--- Job st_test8 Start 09/04/08 15:58:00 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved *** License File has expired 3 days ago Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- st_test8.gms(121) 2 Mb --- Starting execution: elapsed 0:00:00.003 --- st_test8.gms(116) 3 Mb --- Generating MINLP model m --- st_test8.gms(121) 5 Mb --- 21 rows 25 columns 121 non-zeroes --- 387 nl-code 24 nl-non-zeroes --- 24 discrete-columns --- st_test8.gms(121) 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 bonmin.nlp_failure_behavior = fathom 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 -29605.42105262896 24 0.036003 NLP0013I 2 OPT -29578.42857142748 13 0.020001 NLP0013I 3 OPT -29604.99999974625 11 0.016001 NLP0013I 4 OPT -29574.999999997 15 0.024002 NLP0013I 5 OPT -29604.99999998904 14 0.020001 NLP0013I 6 OPT -29604.99999998091 13 0.020001 NLP0013I 7 OPT -29574.99999998944 12 0.020002 NLP0013I 8 OPT -29604.99999985134 12 0.020001 NLP0013I 9 OPT -29574.9999999972 12 0.020001 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible -29605.4 (0.17 seconds) NLP0013I 10 OPT -29604.99999985134 12 0.020001 NLP0012I Num Status Obj It time NLP0013I 1 OPT -29605 0 0 Cbc0004I Integer solution of -29605 found after 12 iterations and 1 nodes (0.19 seconds) NLP0013I 11 OPT -29574.9999999972 12 0.020002 Cbc0011I Exiting as integer gap of 0.421053 less than 0 or 1% Cbc0001I Search completed - best objective -29605, took 24 iterations and 2 nodes (0.21 seconds) Cbc0032I Strong branching done 4 times (102 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 = -29605.000000. All variables are discrete. Dual variables for fixed problem will be not available. NLP0012I Num Status Obj It time NLP0013I 1 OPT -29605 0 0 MINLP solution: -29605 (2 nodes, 0.25 seconds) Best possible: -29605 Absolute gap: 0 Relative gap: 0 GAMS/Bonmin finished. --- Restarting execution --- st_test8.gms(121) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job st_test8.gms Stop 09/04/08 15:58:00 elapsed 0:00:00.280