--- Job prob03 Start 09/03/08 07:14:51 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved *** License File has expired 2 days ago Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- prob03.gms(51) 2 Mb --- Starting execution: elapsed 0:00:00.004 --- prob03.gms(46) 3 Mb --- Generating MINLP model m --- prob03.gms(51) 5 Mb --- 2 rows 3 columns 5 non-zeroes --- 12 nl-code 2 nl-non-zeroes --- 2 discrete-columns --- prob03.gms(51) 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-BB 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 9.165151389921732 8 0.012001 NLP0013I 2 OPT 10.00000000001 5 0.008001 NLP0013I 3 OPT 9.50000000020199 5 0.008 NLP0013I 4 OPT 9.250000000023096 5 0.008001 NLP0013I 5 OPT 9.50000000002 6 0.008 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 9.16515 (0.03 seconds) NLP0013I 6 OPT 9.50000000020199 5 0.004001 NLP0013I 7 OPT 10.00000000001999 6 0.008 NLP0012I Num Status Obj It time NLP0013I 1 OPT 10 0 0 Cbc0004I Integer solution of 10 found after 11 iterations and 2 nodes (0.05 seconds) NLP0013I 8 OPT 12.50000000000981 6 0.008001 NLP0013I 9 OPT 10.00000000001 5 0.004 Cbc0001I Search completed - best objective 10, took 22 iterations and 4 nodes (0.07 seconds) Cbc0032I Strong branching done 2 times (21 iterations), fathomed 0 nodes and fixed 0 variables Cbc0035I Maximum depth 1, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = 10.000000. All variables are discrete. Dual variables for fixed problem will be not available. NLP0012I Num Status Obj It time NLP0013I 1 OPT 10 0 0 MINLP solution: 10 (4 nodes, 0.09 seconds) Best possible: 10 Absolute gap: 0 Relative gap: 0 GAMS/Bonmin finished. --- Restarting execution --- prob03.gms(51) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job prob03.gms Stop 09/03/08 07:14:51 elapsed 0:00:00.112