--- Job du-opt5 Start 09/06/08 10:20:34 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-opt5.gms(685) 2 Mb --- Starting execution: elapsed 0:00:00.009 --- du-opt5.gms(680) 3 Mb --- Generating MINLP model m --- du-opt5.gms(685) 5 Mb --- 10 rows 21 columns 47 non-zeroes --- 14,783 nl-code 20 nl-non-zeroes --- 12 discrete-columns --- du-opt5.gms(685) 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-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.934719197352986 21 0.060004 OA0003I New best feasible of 28.3546 found after 0.036002 sec. Cbc0012I Integer solution of 28.3546 found by noonlinear programm after 2 iterations and 0 nodes (0.04 seconds) Cbc0031I 3 added rows had average density of 9.33333 Cbc0013I At root node, 2 cuts changed objective from 3.93472 to 4.52104 in 2 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) - 2 row cuts, 0 column cuts (2 active) Cbc0014I Cut generator 2 (Probing) - 0 row cuts, 1 column cuts (0 active) Cbc0014I Cut generator 3 (Mixed Integer Rounding) - 1 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.) - 2 row cuts, 0 column cuts (0 active) Cbc0010I After 0 nodes, 1 on tree, 28.3546 best solution, best possible 4.52104 (0.07 seconds) OA0003I New best feasible of 14.1266 found after 0.680042 sec. Cbc0016I Integer solution of 14.1266 found by strong branching after 179 iterations and 15 nodes (0.68 seconds) OA0003I New best feasible of 11.1388 found after 0.748047 sec. Cbc0012I Integer solution of 11.1388 found by noonlinear programm after 189 iterations and 17 nodes (0.78 seconds) OA0003I New best feasible of 9.25891 found after 1.5481 sec. Cbc0016I Integer solution of 9.25891 found by strong branching after 442 iterations and 49 nodes (1.55 seconds) OA0003I New best feasible of 9.14802 found after 1.78811 sec. Cbc0012I Integer solution of 9.14802 found by noonlinear programm after 663 iterations and 81 nodes (1.82 seconds) OA0003I New best feasible of 8.81053 found after 1.85212 sec. OA0003I New best feasible of 8.41914 found after 1.88412 sec. Cbc0012I Integer solution of 8.41914 found by noonlinear programm after 679 iterations and 85 nodes (1.88 seconds) OA0003I New best feasible of 8.40959 found after 1.98812 sec. Cbc0004I Integer solution of 8.40959 found after 740 iterations and 90 nodes (1.99 seconds) Cbc0010I After 100 nodes, 18 on tree, 8.40959 best solution, best possible 6.12917 (2.00 seconds) OA0003I New best feasible of 8.3925 found after 2.63216 sec. Cbc0004I Integer solution of 8.3925 found after 1522 iterations and 188 nodes (2.63 seconds) Cbc0010I After 200 nodes, 50 on tree, 8.3925 best solution, best possible 7.53232 (2.91 seconds) OA0003I New best feasible of 8.32664 found after 3.01619 sec. Cbc0012I Integer solution of 8.32664 found by noonlinear programm after 1671 iterations and 219 nodes (3.02 seconds) OA0003I New best feasible of 8.15323 found after 3.2442 sec. Cbc0004I Integer solution of 8.15323 found after 1859 iterations and 256 nodes (3.25 seconds) OA0003I New best feasible of 8.07366 found after 3.39221 sec. Cbc0012I Integer solution of 8.07366 found by noonlinear programm after 2014 iterations and 280 nodes (3.42 seconds) Cbc0010I After 300 nodes, 32 on tree, 8.07366 best solution, best possible 7.89177 (3.47 seconds) Cbc0001I Search completed - best objective 8.073657582023539, took 2706 iterations and 393 nodes (4.16 seconds) Cbc0032I Strong branching done 152 times (309 iterations), fathomed 2 nodes and fixed 6 variables Cbc0035I Maximum depth 18, 0 variables fixed on reduced cost NLP solution based oa cuts was tried 33 times and created 36 cuts of which 6 were active after adding rounds of cuts Mixed Integer Gomory was tried 341 times and created 267 cuts of which 51 were active after adding rounds of cuts Probing was tried 341 times and created 227 cuts of which 4 were active after adding rounds of cuts Mixed Integer Rounding was tried 341 times and created 1 cuts of which 0 were active after adding rounds of cuts Outer Approximation feasibility check. was tried 65 times and created 162 cuts of which 0 were active after adding rounds of cuts Bonmin finished. Found feasible point. Objective function = 8.073658. Resolve with fixed discrete variables to get dual values. MINLP solution: 8.07365758 (393 nodes, 4.17 seconds) Best possible: 8.073657582 Absolute gap: 1.8056e-09 Relative gap: 2.2365e-10 GAMS/Bonmin finished. --- Restarting execution --- du-opt5.gms(685) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job du-opt5.gms Stop 09/06/08 10:20:39 elapsed 0:00:04.305