--- Job st_test8 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_test8.gms(121) 2 Mb --- Starting execution: elapsed 0:00:00.002 --- st_test8.gms(116) 3 Mb --- Generating MINLP model m --- st_test8.gms(121) 5 Mb --- 21 rows 25 columns 121 non-zeroes --- 387 nl-code 24 nl-non-zeroes --- 24 discrete-columns --- st_test8.gms(121) 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 -29605.42105262896 24 0.040003 OA0003I New best feasible of -29575 found after 0.004 sec. Cbc0012I Integer solution of -29575 found by noonlinear programm after 0 iterations and 0 nodes (0.00 seconds) Cbc0031I 1 added rows had average density of 25 Cbc0013I At root node, 0 cuts changed objective from -29605.4 to -29605.4 in 1 passes Cbc0014I Cut generator 0 (Mixed Integer Gomory) - 0 row cuts, 0 column cuts (0 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.) - 1 row cuts, 0 column cuts (0 active) Cbc0011I Exiting as integer gap of 30.4211 less than 0 or 1% Cbc0001I Search completed - best objective -29575, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost 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 = -29575.000000. All variables are discrete. Dual variables for fixed problem will be not available. MINLP solution: -29575 (0 nodes, -1.73472e-18 seconds) Best possible: -29575 Absolute gap: 0 Relative gap: 0 GAMS/Bonmin finished. --- Restarting execution --- st_test8.gms(121) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job st_test8.gms Stop 09/06/08 16:06:49 elapsed 0:00:00.075