--- Job ex1223b Start 09/06/08 10:20:47 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 --- ex1223b.gms(71) 2 Mb --- Starting execution: elapsed 0:00:00.002 --- ex1223b.gms(66) 3 Mb --- Generating MINLP model m --- ex1223b.gms(71) 5 Mb --- 10 rows 8 columns 32 non-zeroes --- 116 nl-code 17 nl-non-zeroes --- 4 discrete-columns --- ex1223b.gms(71) 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 3.885300456565798 14 0.016001 OA0003I New best feasible of 5.63273 found after 0.016001 sec. Cbc0012I Integer solution of 5.63273 found by noonlinear programm after 4 iterations and 0 nodes (0.02 seconds) Cbc0031I 5 added rows had average density of 4 Cbc0013I At root node, 3 cuts changed objective from 3.8853 to 3.97064 in 3 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) - 3 row cuts, 0 column cuts (2 active) Cbc0014I Cut generator 2 (Probing) - 5 row cuts, 0 column cuts (1 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.) - 6 row cuts, 0 column cuts (0 active) Cbc0010I After 0 nodes, 1 on tree, 5.63273 best solution, best possible 3.97064 (0.02 seconds) OA0003I New best feasible of 4.57958 found after 0.048003 sec. Cbc0016I Integer solution of 4.57958 found by strong branching after 17 iterations and 2 nodes (0.05 seconds) Cbc0001I Search completed - best objective 4.579582402477219, took 26 iterations and 4 nodes (0.07 seconds) Cbc0032I Strong branching done 18 times (35 iterations), fathomed 2 nodes and fixed 0 variables Cbc0035I Maximum depth 1, 0 variables fixed on reduced cost Mixed Integer Gomory was tried 6 times and created 5 cuts of which 3 were active after adding rounds of cuts Probing was tried 6 times and created 5 cuts of which 1 were active after adding rounds of cuts Outer Approximation feasibility check. was tried 4 times and created 24 cuts of which 0 were active after adding rounds of cuts Bonmin finished. Found feasible point. Objective function = 4.579582. Resolve with fixed discrete variables to get dual values. MINLP solution: 4.579582402 (4 nodes, 0.08 seconds) Best possible: 4.579582402 Absolute gap: 1.6042e-11 Relative gap: 3.503e-12 GAMS/Bonmin finished. --- Restarting execution --- ex1223b.gms(71) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ex1223b.gms Stop 09/06/08 10:20:47 elapsed 0:00:00.128