--- Job st_testgr1 Start 09/06/08 11:41:15 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 --- st_testgr1.gms(70) 2 Mb --- Starting execution: elapsed 0:00:00.002 --- st_testgr1.gms(65) 3 Mb --- Generating MINLP model m --- st_testgr1.gms(70) 5 Mb --- 6 rows 11 columns 52 non-zeroes --- 163 nl-code 10 nl-non-zeroes --- 10 discrete-columns --- st_testgr1.gms(70) 3 Mb --- Executing BONMIN: elapsed 0:00:00.004 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 -12.82570493154683 11 0.016001 Cbc0031I 1 added rows had average density of 10 Cbc0013I At root node, 1 cuts changed objective from -12.8257 to -12.8257 in 10 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) - 20 row cuts, 0 column cuts (1 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.) - 0 row cuts, 0 column cuts (0 active) Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible -12.8257 (0.01 seconds) OA0003I New best feasible of -1.96145 found after 0.008001 sec. Cbc0016I Integer solution of -1.96145 found by strong branching after 14 iterations and 1 nodes (0.01 seconds) OA0003I New best feasible of -2.221 found after 0.008001 sec. Cbc0012I Integer solution of -2.221 found by noonlinear programm after 16 iterations and 2 nodes (0.01 seconds) OA0003I New best feasible of -9.95075 found after 0.012001 sec. Cbc0012I Integer solution of -9.95075 found by noonlinear programm after 21 iterations and 3 nodes (0.01 seconds) OA0003I New best feasible of -11.2575 found after 0.016001 sec. Cbc0016I Integer solution of -11.2575 found by strong branching after 36 iterations and 7 nodes (0.02 seconds) OA0003I New best feasible of -11.645 found after 0.032002 sec. Cbc0016I Integer solution of -11.645 found by strong branching after 52 iterations and 12 nodes (0.03 seconds) OA0003I New best feasible of -11.8738 found after 0.060004 sec. Cbc0016I Integer solution of -11.8738 found by strong branching after 110 iterations and 25 nodes (0.06 seconds) OA0003I New best feasible of -12.3084 found after 0.15601 sec. Cbc0012I Integer solution of -12.3084 found by noonlinear programm after 272 iterations and 81 nodes (0.16 seconds) OA0003I New best feasible of -12.3702 found after 0.15601 sec. Cbc0012I Integer solution of -12.3702 found by noonlinear programm after 281 iterations and 85 nodes (0.16 seconds) Cbc0010I After 100 nodes, 26 on tree, -12.3702 best solution, best possible -12.8257 (0.16 seconds) OA0003I New best feasible of -12.5948 found after 0.168011 sec. Cbc0012I Integer solution of -12.5948 found by noonlinear programm after 318 iterations and 115 nodes (0.17 seconds) Cbc0010I After 200 nodes, 59 on tree, -12.5948 best solution, best possible -12.8257 (0.20 seconds) OA0003I New best feasible of -12.7929 found after 0.216014 sec. Cbc0012I Integer solution of -12.7929 found by noonlinear programm after 538 iterations and 235 nodes (0.22 seconds) Cbc0011I Exiting as integer gap of 0.0328049 less than 0 or 1% Cbc0001I Search completed - best objective -12.7929, took 540 iterations and 236 nodes (0.22 seconds) Cbc0032I Strong branching done 82 times (85 iterations), fathomed 0 nodes and fixed 3 variables Cbc0035I Maximum depth 21, 0 variables fixed on reduced cost NLP solution based oa cuts was tried 31 times and created 7 cuts of which 2 were active after adding rounds of cuts Mixed Integer Gomory was tried 101 times and created 159 cuts of which 56 were active after adding rounds of cuts Probing was tried 101 times and created 63 cuts of which 0 were active after adding rounds of cuts Outer Approximation feasibility check. was tried 26 times and created 34 cuts of which 0 were active after adding rounds of cuts Bonmin finished. Found feasible point. Objective function = -12.792900. All variables are discrete. Dual variables for fixed problem will be not available. MINLP solution: -12.7929 (236 nodes, 0.22 seconds) Best possible: -12.7929 Absolute gap: 0 Relative gap: 0 GAMS/Bonmin finished. --- Restarting execution --- st_testgr1.gms(70) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job st_testgr1.gms Stop 09/06/08 11:41:15 elapsed 0:00:00.273