--- Job st_miqp3 Start 09/06/08 11:41:14 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_miqp3.gms(51) 2 Mb --- Starting execution: elapsed 0:00:00.002 --- st_miqp3.gms(46) 3 Mb --- Generating MINLP model m --- st_miqp3.gms(51) 5 Mb --- 2 rows 3 columns 5 non-zeroes --- 14 nl-code 1 nl-non-zeroes --- 2 discrete-columns --- st_miqp3.gms(51) 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 -5.999999999989909 24 0.032002 OA0003I New best feasible of 0 found after 0 sec. Cbc0012I Integer solution of 0 found by noonlinear programm after 0 iterations and 0 nodes (0.00 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 0 cuts changed objective from -6 to -6 in 1 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) - 0 row cuts, 0 column cuts (0 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.) - 1 row cuts, 0 column cuts (0 active) OA0003I New best feasible of -6 found after 0.004 sec. Cbc0016I Integer solution of -6 found by strong branching after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective -6, took 0 iterations and 0 nodes (0.00 seconds) Cbc0032I Strong branching done 2 times (2 iterations), fathomed 1 nodes and fixed 0 variables Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation feasibility check. was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts Bonmin finished. Found feasible point. Objective function = -6.000000. All variables are discrete. Dual variables for fixed problem will be not available. MINLP solution: -6 (0 nodes, 0 seconds) Best possible: -6 Absolute gap: 0 Relative gap: 0 GAMS/Bonmin finished. --- Restarting execution --- st_miqp3.gms(51) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job st_miqp3.gms Stop 09/06/08 11:41:14 elapsed 0:00:00.063