--- Job st_miqp4 Start 09/04/08 15:57:57 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_miqp4.gms(64) 2 Mb --- Starting execution: elapsed 0:00:00.002 --- st_miqp4.gms(59) 3 Mb --- Generating MINLP model m --- st_miqp4.gms(64) 5 Mb --- 5 rows 7 columns 16 non-zeroes --- 51 nl-code 3 nl-non-zeroes --- 3 discrete-columns --- st_miqp4.gms(64) 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.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 -4576.4999999997 20 0.032002 NLP0013I 2 OPT -3.999999974327781 39 0.064004 Restoration phase is called at point that is almost feasible, with constraint violation 8.881784e-16. Abort. NLP0013I 3 FAILED -1190.879144891443 3 0.004 NLP0014I * r1 OPT -4573.99999999975 18 0.024001 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible -4576.5 (0.10 seconds) NLP0013I 5 OPT -4573.9999999999 14 0.020001 Restoration phase is called at point that is almost feasible, with constraint violation 1.720846e-15. Abort. NLP0012I Num Status Obj It time NLP0013I 1 FAILED -3092.824889234324 3 0.004 NLP0014I * r1 OPT -4573.999999999851 22 0.028002 Cbc0004I Integer solution of -4574 found after 14 iterations and 1 nodes (0.15 seconds) NLP0013I 6 OPT -3.999999990560229 30 0.048003 Cbc0011I Exiting as integer gap of 2.5 less than 0 or 1% Cbc0001I Search completed - best objective -4573.999999999851, took 44 iterations and 2 nodes (0.20 seconds) Cbc0032I Strong branching done 1 times (57 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 = -4574.000000. Resolve with fixed discrete variables to get dual values. Restoration phase is called at point that is almost feasible, with constraint violation 4.815592e-15. Abort. NLP0012I Num Status Obj It time NLP0013I 1 FAILED -3092.824889234513 3 0.004 NLP0014I * r1 OPT -4573.999999999851 22 0.028002 MINLP solution: -4574 (2 nodes, 0.28 seconds) Best possible: -4574 Absolute gap: 0 Relative gap: 0 GAMS/Bonmin finished. --- Restarting execution --- st_miqp4.gms(64) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job st_miqp4.gms Stop 09/04/08 15:57:58 elapsed 0:00:00.300