--- Job st_testph4 Start 09/06/08 01:38:44 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 --- st_testph4.gms(71) 2 Mb --- Starting execution: elapsed 0:00:00.002 --- st_testph4.gms(66) 3 Mb --- Generating MINLP model m --- st_testph4.gms(71) 5 Mb --- 11 rows 4 columns 28 non-zeroes --- 51 nl-code 3 nl-non-zeroes --- 3 discrete-columns --- st_testph4.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 -82.96153846151765 11 0.020001 NLP0013I 2 OPT -82.87499999997998 9 0.012001 NLP0013I 3 OPT -80.49999999997 6 0.012001 NLP0013I 4 OPT -82.94444444442442 8 0.012001 NLP0013I 5 OPT -77.99999999997 7 0.012 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible -82.9615 (0.05 seconds) NLP0013I 6 OPT -82.94444444442442 8 0.012001 NLP0013I 7 OPT -79.62499999990069 7 0.008001 NLP0013I 8 OPT -73.49999999999 5 0.008 NLP0013I 9 INFEAS -84.00000000000014 9 0.020001 NLP0013I 10 OPT -73.49999999999 5 0.008 NLP0012I Num Status Obj It time NLP0013I 1 OPT -73.5 0 0 Cbc0004I Integer solution of -73.5 found after 20 iterations and 2 nodes (0.11 seconds) NLP0013I 11 OPT -80.49999999998001 6 0.008001 NLP0013I 2 OPT -80.5 0 0 Cbc0004I Integer solution of -80.5 found after 26 iterations and 3 nodes (0.12 seconds) NLP0013I 12 OPT -77.99999999997 7 0.012 Cbc0001I Search completed - best objective -80.5, took 33 iterations and 4 nodes (0.13 seconds) Cbc0032I Strong branching done 3 times (44 iterations), fathomed 0 nodes and fixed 1 variables Cbc0035I Maximum depth 1, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = -80.500000. All variables are discrete. Dual variables for fixed problem will be not available. NLP0012I Num Status Obj It time NLP0013I 1 OPT -80.5 0 0 MINLP solution: -80.5 (4 nodes, 0.15 seconds) Best possible: -80.5 Absolute gap: 0 Relative gap: 0 GAMS/Bonmin finished. --- Restarting execution --- st_testph4.gms(71) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job st_testph4.gms Stop 09/06/08 01:38:44 elapsed 0:00:00.178