--- Job du-opt Start 09/06/08 10:20:39 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.020 GAMS/Bonmin MINLP Solver (Bonmin Library 0.99) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-Hyb 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 (NLP solution based oa cuts) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 1 (Mixed Integer Gomory) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Probing) - 0 row cuts, 1 column cuts (0 active) Cbc0014I Cut generator 3 (Mixed Integer Rounding) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 4 (Cover) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 5 (Clique) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 6 (Flow Covers) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 7 (Outer Approximation decomposition.) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 8 (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 5.15644 found after 0.920057 sec. Cbc0012I Integer solution of 5.15644 found by noonlinear programm after 310 iterations and 67 nodes (0.92 seconds) OA0003I New best feasible of 5.12505 found after 1.02806 sec. Cbc0012I Integer solution of 5.12505 found by noonlinear programm after 347 iterations and 70 nodes (1.02 seconds) Cbc0010I After 100 nodes, 38 on tree, 5.12505 best solution, best possible 3.51351 (1.34 seconds) OA0003I New best feasible of 3.90817 found after 1.6761 sec. Cbc0012I Integer solution of 3.90817 found by noonlinear programm after 735 iterations and 115 nodes (1.67 seconds) OA0003I New best feasible of 3.80422 found after 2.09213 sec. Cbc0012I Integer solution of 3.80422 found by noonlinear programm after 822 iterations and 130 nodes (2.09 seconds) OA0003I New best feasible of 3.8005 found after 2.12413 sec. Cbc0012I Integer solution of 3.8005 found by noonlinear programm after 842 iterations and 132 nodes (2.12 seconds) Cbc0010I After 200 nodes, 70 on tree, 3.8005 best solution, best possible 3.51351 (2.30 seconds) Cbc0010I After 300 nodes, 125 on tree, 3.8005 best solution, best possible 3.51351 (2.44 seconds) OA0003I New best feasible of 3.77921 found after 2.61616 sec. Cbc0012I Integer solution of 3.77921 found by noonlinear programm after 1642 iterations and 377 nodes (2.62 seconds) OA0003I New best feasible of 3.76469 found after 2.65617 sec. Cbc0012I Integer solution of 3.76469 found by noonlinear programm after 1650 iterations and 380 nodes (2.65 seconds) Cbc0010I After 400 nodes, 176 on tree, 3.76469 best solution, best possible 3.51351 (2.67 seconds) OA0003I New best feasible of 3.68609 found after 2.83218 sec. Cbc0012I Integer solution of 3.68609 found by noonlinear programm after 2107 iterations and 459 nodes (2.83 seconds) Cbc0010I After 500 nodes, 211 on tree, 3.68609 best solution, best possible 3.51351 (3.12 seconds) Cbc0010I After 600 nodes, 253 on tree, 3.68609 best solution, best possible 3.51351 (3.30 seconds) Cbc0010I After 700 nodes, 292 on tree, 3.68609 best solution, best possible 3.51351 (3.55 seconds) Cbc0010I After 800 nodes, 331 on tree, 3.68609 best solution, best possible 3.51351 (3.72 seconds) OA0003I New best feasible of 3.63506 found after 4.35627 sec. Cbc0012I Integer solution of 3.63506 found by noonlinear programm after 4690 iterations and 890 nodes (4.38 seconds) OA0003I New best feasible of 3.6327 found after 4.42428 sec. Cbc0004I Integer solution of 3.6327 found after 4712 iterations and 891 nodes (4.42 seconds) Cbc0010I After 900 nodes, 351 on tree, 3.6327 best solution, best possible 3.51351 (4.46 seconds) Cbc0010I After 1000 nodes, 388 on tree, 3.6327 best solution, best possible 3.51351 (4.57 seconds) OA0003I New best feasible of 3.62227 found after 4.61629 sec. Cbc0012I Integer solution of 3.62227 found by noonlinear programm after 5875 iterations and 1011 nodes (4.62 seconds) Cbc0010I After 1100 nodes, 406 on tree, 3.62227 best solution, best possible 3.51351 (4.77 seconds) OA0003I New best feasible of 3.59646 found after 5.00831 sec. Cbc0012I Integer solution of 3.59646 found by noonlinear programm after 6713 iterations and 1109 nodes (5.00 seconds) OA0003I New best feasible of 3.58608 found after 5.34833 sec. Cbc0012I Integer solution of 3.58608 found by noonlinear programm after 6876 iterations and 1142 nodes (5.34 seconds) Cbc0010I After 1200 nodes, 381 on tree, 3.58608 best solution, best possible 3.51432 (5.53 seconds) Cbc0010I After 1300 nodes, 371 on tree, 3.58608 best solution, best possible 3.5176 (5.67 seconds) Cbc0010I After 1400 nodes, 374 on tree, 3.58608 best solution, best possible 3.5235 (5.77 seconds) Cbc0010I After 1500 nodes, 376 on tree, 3.58608 best solution, best possible 3.52777 (5.89 seconds) Cbc0010I After 1600 nodes, 367 on tree, 3.58608 best solution, best possible 3.53372 (6.28 seconds) Cbc0010I After 1700 nodes, 360 on tree, 3.58608 best solution, best possible 3.53863 (6.76 seconds) Cbc0010I After 1800 nodes, 359 on tree, 3.58608 best solution, best possible 3.54433 (6.87 seconds) OA0003I New best feasible of 3.58313 found after 6.92843 sec. Cbc0012I Integer solution of 3.58313 found by noonlinear programm after 12323 iterations and 1829 nodes (6.92 seconds) OA0003I New best feasible of 3.57913 found after 7.05244 sec. Cbc0012I Integer solution of 3.57913 found by noonlinear programm after 12430 iterations and 1858 nodes (7.05 seconds) Cbc0011I Exiting as integer gap of 0.0348009 less than 0 or 1% Cbc0001I Search completed - best objective 3.57912597106685, took 12432 iterations and 1858 nodes (7.06 seconds) Cbc0032I Strong branching done 190 times (283 iterations), fathomed 0 nodes and fixed 5 variables Cbc0035I Maximum depth 28, 0 variables fixed on reduced cost NLP solution based oa cuts was tried 169 times and created 40 cuts of which 7 were active after adding rounds of cuts Mixed Integer Gomory was tried 2 times and created 2 cuts of which 2 were active after adding rounds of cuts Outer Approximation feasibility check. was tried 93 times and created 240 cuts of which 0 were active after adding rounds of cuts Bonmin finished. Found feasible point. Objective function = 3.579126. Resolve with fixed discrete variables to get dual values. MINLP solution: 3.579125802 (1858 nodes, 7.08 seconds) Best possible: 3.579125971 Absolute gap: 1.6933e-07 Relative gap: 4.7311e-08 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 10:20:46 elapsed 0:00:07.463