--- Job ex1223a Start 09/06/08 14:43:31 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 --- ex1223a.gms(71) 2 Mb --- Starting execution: elapsed 0:00:00.002 --- ex1223a.gms(66) 3 Mb --- Generating MINLP model m --- ex1223a.gms(71) 5 Mb --- 10 rows 8 columns 32 non-zeroes --- 64 nl-code 9 nl-non-zeroes --- 4 discrete-columns --- ex1223a.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-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 4.487460805340645 10 0.016001 OA0003I New best feasible of 4.57958 found after 0.008001 sec. Cbc0012I Integer solution of 4.57958 found by noonlinear programm after 2 iterations and 0 nodes (0.01 seconds) Cbc0031I 2 added rows had average density of 4.5 Cbc0013I At root node, 2 cuts changed objective from 4.48746 to 4.57958 in 2 passes Cbc0014I Cut generator 0 (Mixed Integer Gomory) - 1 row cuts, 0 column cuts (1 active) Cbc0014I Cut generator 1 (Probing) - 1 row cuts, 0 column cuts (1 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.) - 7 row cuts, 0 column cuts (0 active) Cbc0001I Search completed - best objective 4.579582402483023, took 2 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Mixed Integer Gomory was tried 2 times and created 1 cuts of which 1 were active after adding rounds of cuts Probing was tried 2 times and created 1 cuts of which 1 were active after adding rounds of cuts Outer Approximation feasibility check. was tried 1 times and created 7 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 (0 nodes, 0.02 seconds) Best possible: 4.579582402 Absolute gap: 0 Relative gap: 0 GAMS/Bonmin finished. --- Restarting execution --- ex1223a.gms(71) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ex1223a.gms Stop 09/06/08 14:43:31 elapsed 0:00:00.065