--- Job ex1223a Start 09/05/08 04:01:33 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved *** License File has expired 4 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-BB yes bonmin.max_consecutive_infeasible = 3 yes bonmin.nlp_failure_behavior = fathom yes bonmin.num_resolve_at_infeasibles = 1 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 NLP0013I 2 OPT 4.579582402516901 11 0.016001 NLP0013I 3 OPT 5.136852819520017 11 0.016001 NLP0013I 4 OPT 4.781865296299005 10 0.016001 NLP0013I 5 OPT 4.487460805350586 7 0.012001 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 4.48746 (0.06 seconds) NLP0013I 6 OPT 4.579582402516901 11 0.016001 NLP0012I Num Status Obj It time NLP0013I 1 OPT 4.579582402486738 5 0.008 Cbc0004I Integer solution of 4.57958 found after 11 iterations and 1 nodes (0.09 seconds) NLP0013I 7 OPT 5.136852819520017 11 0.016001 Cbc0001I Search completed - best objective 4.579582402486738, took 22 iterations and 2 nodes (0.10 seconds) Cbc0032I Strong branching done 2 times (39 iterations), fathomed 0 nodes and fixed 0 variables Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = 4.579582. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT 4.579582402486738 5 0.008001 MINLP solution: 4.579582402 (2 nodes, 0.13 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/05/08 04:01:34 elapsed 0:00:00.157