--- Job alan Start 09/06/08 14:43:11 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 --- alan.gms(74) 2 Mb --- Starting execution: elapsed 0:00:00.002 --- alan.gms(68) 3 Mb --- Generating MINLP model m --- alan.gms(73) 5 Mb --- 8 rows 9 columns 24 non-zeroes --- 66 nl-code 3 nl-non-zeroes --- 4 discrete-columns --- alan.gms(73) 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 2.899038461538461 7 0.032002 OA0003I New best feasible of 3.6 found after 0.044003 sec. Cbc0012I Integer solution of 3.6 found by noonlinear programm after 2 iterations and 0 nodes (0.04 seconds) Cbc0031I 2 added rows had average density of 4 Cbc0013I At root node, 2 cuts changed objective from 2.89904 to 2.89904 in 2 passes Cbc0014I Cut generator 0 (Mixed Integer Gomory) - 2 row cuts, 0 column cuts (2 active) Cbc0014I Cut generator 1 (Probing) - 1 row cuts, 1 column cuts (0 active) Cbc0014I Cut generator 2 (Mixed Integer Rounding) - 1 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 3 (Cover) - 1 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) - 1 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.) - 2 row cuts, 0 column cuts (0 active) Cbc0010I After 0 nodes, 1 on tree, 3.6 best solution, best possible 2.89904 (0.04 seconds) OA0003I New best feasible of 3.12353 found after 0.088005 sec. Cbc0016I Integer solution of 3.12353 found by strong branching after 2 iterations and 1 nodes (0.08 seconds) OA0003I New best feasible of 2.925 found after 0.096006 sec. Cbc0016I Integer solution of 2.925 found by strong branching after 2 iterations and 1 nodes (0.09 seconds) Cbc0011I Exiting as integer gap of 0.0259615 less than 0 or 1% Cbc0001I Search completed - best objective 2.924999999953172, took 8 iterations and 2 nodes (0.20 seconds) Cbc0032I Strong branching done 10 times (14 iterations), fathomed 2 nodes and fixed 1 variables Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Mixed Integer Gomory was tried 4 times and created 3 cuts of which 3 were active after adding rounds of cuts Probing was tried 4 times and created 4 cuts of which 0 were active after adding rounds of cuts Mixed Integer Rounding was tried 4 times and created 1 cuts of which 0 were active after adding rounds of cuts Cover was tried 4 times and created 1 cuts of which 0 were active after adding rounds of cuts Flow Covers was tried 4 times and created 1 cuts of which 0 were active after adding rounds of cuts Outer Approximation feasibility check. was tried 9 times and created 22 cuts of which 0 were active after adding rounds of cuts Bonmin finished. Found feasible point. Objective function = 2.925000. Resolve with fixed discrete variables to get dual values. MINLP solution: 2.925 (2 nodes, 0.24 seconds) Best possible: 2.925 Absolute gap: 4.6828e-11 Relative gap: 1.601e-11 GAMS/Bonmin finished. --- Restarting execution --- alan.gms(73) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job alan.gms Stop 09/06/08 14:43:11 elapsed 0:00:00.362