--- Job du-opt Start 09/06/08 14:43:20 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved *** License File has expired 5 days ago Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- du-opt.gms(691) 2 Mb --- Starting execution: elapsed 0:00:00.009 --- du-opt.gms(686) 3 Mb --- Generating MINLP model m --- du-opt.gms(691) 5 Mb --- 10 rows 21 columns 47 non-zeroes --- 14,783 nl-code 20 nl-non-zeroes --- 13 discrete-columns --- du-opt.gms(691) 3 Mb --- Executing BONMIN: elapsed 0:00:00.021 GAMS/Bonmin MINLP Solver (Bonmin Library 0.99) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Common Public License (CPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** NLP0012I Num Status Obj It time NLP0013I 1 OPT 3.513512681664662 21 0.060004 OA0003I New best feasible of 31.2598 found after 0.036002 sec. Cbc0012I Integer solution of 31.2598 found by noonlinear programm after 0 iterations and 0 nodes (0.03 seconds) Cbc0031I 2 added rows had average density of 13 Cbc0013I At root node, 1 cuts changed objective from 3.51351 to 3.51351 in 1 passes Cbc0014I Cut generator 0 (Mixed Integer Gomory) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 1 (Probing) - 0 row cuts, 1 column cuts (0 active) Cbc0014I Cut generator 2 (Mixed Integer Rounding) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 3 (Cover) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 4 (Clique) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 5 (Flow Covers) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 6 (Outer Approximation decomposition.) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 7 (Outer Approximation feasibility check.) - 3 row cuts, 0 column cuts (0 active) OA0003I New best feasible of 6.86755 found after 0.064004 sec. Cbc0016I Integer solution of 6.86755 found by strong branching after 0 iterations and 0 nodes (0.06 seconds) Cbc0010I After 0 nodes, 1 on tree, 6.86755 best solution, best possible 3.51351 (0.06 seconds) OA0003I New best feasible of 6.66916 found after 0.512032 sec. Cbc0012I Integer solution of 6.66916 found by noonlinear programm after 164 iterations and 65 nodes (0.51 seconds) OA0003I New best feasible of 6.58798 found after 0.548034 sec. Cbc0016I Integer solution of 6.58798 found by strong branching after 177 iterations and 69 nodes (0.54 seconds) Cbc0010I After 100 nodes, 51 on tree, 6.58798 best solution, best possible 3.51351 (0.63 seconds) OA0003I New best feasible of 6.41175 found after 0.672042 sec. Cbc0012I Integer solution of 6.41175 found by noonlinear programm after 303 iterations and 115 nodes (0.67 seconds) OA0003I New best feasible of 4.9819 found after 0.764048 sec. Cbc0012I Integer solution of 4.9819 found by noonlinear programm after 514 iterations and 161 nodes (0.76 seconds) OA0003I New best feasible of 4.37877 found after 0.80405 sec. Cbc0012I Integer solution of 4.37877 found by noonlinear programm after 557 iterations and 166 nodes (0.80 seconds) Cbc0010I After 200 nodes, 94 on tree, 4.37877 best solution, best possible 3.51351 (0.89 seconds) Cbc0010I After 300 nodes, 148 on tree, 4.37877 best solution, best possible 3.51351 (1.16 seconds) OA0003I New best feasible of 4.29187 found after 1.21208 sec. Cbc0012I Integer solution of 4.29187 found by noonlinear programm after 1207 iterations and 321 nodes (1.21 seconds) OA0003I New best feasible of 3.77759 found after 1.46809 sec. Cbc0012I Integer solution of 3.77759 found by noonlinear programm after 1455 iterations and 361 nodes (1.46 seconds) Cbc0010I After 400 nodes, 175 on tree, 3.77759 best solution, best possible 3.51351 (1.54 seconds) Cbc0010I After 500 nodes, 224 on tree, 3.77759 best solution, best possible 3.51351 (1.80 seconds) Cbc0010I After 600 nodes, 272 on tree, 3.77759 best solution, best possible 3.51351 (2.32 seconds) Cbc0010I After 700 nodes, 325 on tree, 3.77759 best solution, best possible 3.51351 (2.55 seconds) Cbc0010I After 800 nodes, 369 on tree, 3.77759 best solution, best possible 3.51351 (2.73 seconds) Cbc0010I After 900 nodes, 414 on tree, 3.77759 best solution, best possible 3.51351 (2.96 seconds) OA0003I New best feasible of 3.76898 found after 3.30421 sec. Cbc0012I Integer solution of 3.76898 found by noonlinear programm after 3807 iterations and 982 nodes (3.30 seconds) Cbc0010I After 1000 nodes, 457 on tree, 3.76898 best solution, best possible 3.51351 (3.36 seconds) Cbc0010I After 1100 nodes, 505 on tree, 3.76898 best solution, best possible 3.51351 (3.59 seconds) OA0003I New best feasible of 3.62877 found after 3.68023 sec. Cbc0012I Integer solution of 3.62877 found by noonlinear programm after 4358 iterations and 1119 nodes (3.68 seconds) Cbc0010I After 1200 nodes, 514 on tree, 3.62877 best solution, best possible 3.51351 (3.84 seconds) Cbc0010I After 1300 nodes, 549 on tree, 3.62877 best solution, best possible 3.51351 (4.14 seconds) Cbc0010I After 1400 nodes, 580 on tree, 3.62877 best solution, best possible 3.51351 (4.59 seconds) Cbc0010I After 1500 nodes, 614 on tree, 3.62877 best solution, best possible 3.51351 (4.88 seconds) Cbc0010I After 1600 nodes, 656 on tree, 3.62877 best solution, best possible 3.51351 (5.10 seconds) Cbc0010I After 1700 nodes, 679 on tree, 3.62877 best solution, best possible 3.51351 (5.50 seconds) OA0003I New best feasible of 3.62145 found after 5.88837 sec. Cbc0012I Integer solution of 3.62145 found by noonlinear programm after 8425 iterations and 1800 nodes (5.88 seconds) Cbc0010I After 1800 nodes, 699 on tree, 3.62145 best solution, best possible 3.51351 (5.89 seconds) OA0003I New best feasible of 3.60021 found after 6.64842 sec. Cbc0012I Integer solution of 3.60021 found by noonlinear programm after 8787 iterations and 1889 nodes (6.65 seconds) Cbc0010I After 1900 nodes, 721 on tree, 3.60021 best solution, best possible 3.51351 (6.66 seconds) Cbc0010I After 2000 nodes, 749 on tree, 3.60021 best solution, best possible 3.51351 (6.92 seconds) OA0003I New best feasible of 3.58781 found after 7.15245 sec. Cbc0012I Integer solution of 3.58781 found by noonlinear programm after 10035 iterations and 2078 nodes (7.15 seconds) Cbc0010I After 2100 nodes, 775 on tree, 3.58781 best solution, best possible 3.51351 (7.17 seconds) OA0003I New best feasible of 3.58261 found after 7.38046 sec. Cbc0012I Integer solution of 3.58261 found by noonlinear programm after 10372 iterations and 2147 nodes (7.38 seconds) OA0003I New best feasible of 3.58001 found after 7.41646 sec. Cbc0012I Integer solution of 3.58001 found by noonlinear programm after 10386 iterations and 2156 nodes (7.41 seconds) Cbc0010I After 2200 nodes, 785 on tree, 3.58001 best solution, best possible 3.51355 (7.46 seconds) Cbc0010I After 2300 nodes, 762 on tree, 3.58001 best solution, best possible 3.51389 (7.56 seconds) Cbc0010I After 2400 nodes, 746 on tree, 3.58001 best solution, best possible 3.51434 (7.66 seconds) Cbc0010I After 2500 nodes, 726 on tree, 3.58001 best solution, best possible 3.5149 (7.77 seconds) Cbc0010I After 2600 nodes, 701 on tree, 3.58001 best solution, best possible 3.51594 (7.91 seconds) Cbc0010I After 2700 nodes, 675 on tree, 3.58001 best solution, best possible 3.51728 (8.00 seconds) Cbc0010I After 2800 nodes, 659 on tree, 3.58001 best solution, best possible 3.51859 (8.16 seconds) Cbc0010I After 2900 nodes, 642 on tree, 3.58001 best solution, best possible 3.51974 (8.25 seconds) Cbc0010I After 3000 nodes, 626 on tree, 3.58001 best solution, best possible 3.52121 (8.35 seconds) Cbc0010I After 3100 nodes, 617 on tree, 3.58001 best solution, best possible 3.52324 (8.48 seconds) Cbc0010I After 3200 nodes, 617 on tree, 3.58001 best solution, best possible 3.52465 (8.60 seconds) OA0003I New best feasible of 3.5741 found after 8.69254 sec. Cbc0012I Integer solution of 3.5741 found by noonlinear programm after 22400 iterations and 3231 nodes (8.92 seconds) Cbc0010I After 3300 nodes, 577 on tree, 3.5741 best solution, best possible 3.52584 (9.08 seconds) Cbc0010I After 3400 nodes, 572 on tree, 3.5741 best solution, best possible 3.52713 (9.24 seconds) OA0003I New best feasible of 3.57114 found after 9.33258 sec. Cbc0012I Integer solution of 3.57114 found by noonlinear programm after 23986 iterations and 3437 nodes (9.33 seconds) OA0003I New best feasible of 3.56738 found after 9.41659 sec. Cbc0012I Integer solution of 3.56738 found by noonlinear programm after 24128 iterations and 3461 nodes (9.41 seconds) Cbc0010I After 3500 nodes, 517 on tree, 3.56738 best solution, best possible 3.5292 (9.47 seconds) OA0003I New best feasible of 3.56129 found after 9.6446 sec. Cbc0016I Integer solution of 3.56129 found by strong branching after 25234 iterations and 3593 nodes (9.64 seconds) Cbc0011I Exiting as integer gap of 0.029879 less than 0 or 1% Cbc0001I Search completed - best objective 3.56128880850752, took 25239 iterations and 3594 nodes (9.71 seconds) Cbc0032I Strong branching done 298 times (639 iterations), fathomed 10 nodes and fixed 46 variables Cbc0035I Maximum depth 32, 0 variables fixed on reduced cost Mixed Integer Gomory was tried 4 times and created 6 cuts of which 1 were active after adding rounds of cuts Outer Approximation feasibility check. was tried 158 times and created 403 cuts of which 0 were active after adding rounds of cuts Bonmin finished. Found feasible point. Objective function = 3.561289. Resolve with fixed discrete variables to get dual values. MINLP solution: 3.561275661 (3594 nodes, 9.73 seconds) Best possible: 3.561288809 Absolute gap: 1.3148e-05 Relative gap: 3.6919e-06 GAMS/Bonmin finished. --- Restarting execution --- du-opt.gms(691) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job du-opt.gms Stop 09/06/08 14:43:30 elapsed 0:00:09.997