--- Job st_testgr1 Start 09/06/08 16:06:49 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-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 -12.82570493154683 11 0.020001 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 (Mixed Integer Gomory) - 20 row cuts, 0 column cuts (1 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.) - 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.012001 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.020001 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.7734 found after 0.028002 sec. Cbc0016I Integer solution of -11.7734 found by strong branching after 55 iterations and 14 nodes (0.03 seconds) OA0003I New best feasible of -11.8092 found after 0.15601 sec. Cbc0016I Integer solution of -11.8092 found by strong branching after 323 iterations and 99 nodes (0.16 seconds) Cbc0010I After 100 nodes, 27 on tree, -11.8092 best solution, best possible -12.8257 (0.16 seconds) OA0003I New best feasible of -12.4789 found after 0.180011 sec. Cbc0012I Integer solution of -12.4789 found by noonlinear programm after 440 iterations and 161 nodes (0.18 seconds) Cbc0010I After 200 nodes, 61 on tree, -12.4789 best solution, best possible -12.8257 (0.20 seconds) Cbc0010I After 300 nodes, 109 on tree, -12.4789 best solution, best possible -12.8257 (0.24 seconds) OA0003I New best feasible of -12.621 found after 0.244015 sec. Cbc0012I Integer solution of -12.621 found by noonlinear programm after 718 iterations and 312 nodes (0.24 seconds) Cbc0010I After 400 nodes, 123 on tree, -12.621 best solution, best possible -12.8257 (0.28 seconds) OA0003I New best feasible of -12.7637 found after 0.31202 sec. Cbc0012I Integer solution of -12.7637 found by noonlinear programm after 1038 iterations and 474 nodes (0.31 seconds) Cbc0011I Exiting as integer gap of 0.0619549 less than 0 or 1% Cbc0001I Search completed - best objective -12.76375, took 1041 iterations and 475 nodes (0.31 seconds) Cbc0032I Strong branching done 78 times (80 iterations), fathomed 2 nodes and fixed 0 variables Cbc0035I Maximum depth 24, 0 variables fixed on reduced cost Mixed Integer Gomory was tried 155 times and created 276 cuts of which 119 were active after adding rounds of cuts Probing was tried 155 times and created 111 cuts of which 0 were active after adding rounds of cuts Outer Approximation feasibility check. was tried 54 times and created 67 cuts of which 0 were active after adding rounds of cuts Bonmin finished. Found feasible point. Objective function = -12.763750. All variables are discrete. Dual variables for fixed problem will be not available. MINLP solution: -12.76375 (475 nodes, 0.31 seconds) Best possible: -12.76375 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 16:06:50 elapsed 0:00:00.360