--- Job st_testgr3 Start 09/06/08 16:06:50 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_testgr3.gms(119) 2 Mb --- Starting execution: elapsed 0:00:00.002 --- st_testgr3.gms(114) 3 Mb --- Generating MINLP model m --- st_testgr3.gms(119) 5 Mb --- 21 rows 21 columns 182 non-zeroes --- 323 nl-code 20 nl-non-zeroes --- 20 discrete-columns --- st_testgr3.gms(119) 3 Mb --- Executing BONMIN: elapsed 0:00:00.005 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 -20.71997576354901 13 0.020001 Cbc0031I 4 added rows had average density of 8.5 Cbc0013I At root node, 4 cuts changed objective from -20.72 to -20.6497 in 10 passes Cbc0014I Cut generator 0 (Mixed Integer Gomory) - 34 row cuts, 0 column cuts (4 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 -20.6497 (0.02 seconds) OA0003I New best feasible of -20.4775 found after 0.036002 sec. Cbc0012I Integer solution of -20.4775 found by noonlinear programm after 54 iterations and 9 nodes (0.03 seconds) Cbc0011I Exiting as integer gap of 0.172167 less than 0 or 1% Cbc0001I Search completed - best objective -20.4775, took 56 iterations and 10 nodes (0.03 seconds) Cbc0032I Strong branching done 64 times (79 iterations), fathomed 0 nodes and fixed 0 variables Cbc0035I Maximum depth 6, 0 variables fixed on reduced cost Mixed Integer Gomory was tried 20 times and created 63 cuts of which 17 were active after adding rounds of cuts Outer Approximation feasibility check. was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts Bonmin finished. Found feasible point. Objective function = -20.477500. All variables are discrete. Dual variables for fixed problem will be not available. MINLP solution: -20.4775 (10 nodes, 0.04 seconds) Best possible: -20.4775 Absolute gap: 0 Relative gap: 0 GAMS/Bonmin finished. --- Restarting execution --- st_testgr3.gms(119) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job st_testgr3.gms Stop 09/06/08 16:06:50 elapsed 0:00:00.088