--- Job synthes2 Start 09/03/08 10:36:48 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 --- synthes2.gms(83) 2 Mb --- Starting execution: elapsed 0:00:00.004 --- synthes2.gms(78) 3 Mb --- Generating MINLP model m --- synthes2.gms(83) 5 Mb --- 15 rows 12 columns 49 non-zeroes --- 81 nl-code 8 nl-non-zeroes --- 5 discrete-columns --- synthes2.gms(83) 3 Mb --- Executing BONMIN: elapsed 0:00:00.006 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 -0.5544169122836422 22 0.036002 NLP0013I 2 OPT 58.81054052166849 13 0.020001 NLP0013I 3 OPT 67.90511009979006 14 0.020001 NLP0013I 4 OPT 67.90511009978897 14 0.020001 NLP0013I 5 OPT 58.81054052167011 13 0.016001 NLP0013I 6 OPT 44.43293726368675 21 0.028001 NLP0013I 7 OPT 3.945583087706353 8 0.012001 NLP0013I 8 OPT 27.57150211309002 54 0.276018 NLP0013I 9 OPT 7.341187944675966 9 0.016001 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible -0.554417 (0.42 seconds) NLP0013I 10 OPT 58.81054052167011 13 0.020001 NLP0013I 11 OPT 63.9814290703295 13 0.020001 NLP0013I 12 OPT 73.0353125251052 16 0.024002 NLP0012I Num Status Obj It time NLP0013I 1 OPT 73.03531252510086 6 0.008 Cbc0004I Integer solution of 73.0353 found after 42 iterations and 3 nodes (0.50 seconds) NLP0013I 13 OPT 74.29448652087117 29 0.040003 NLP0013I 14 OPT 77.35592167774573 21 0.028002 NLP0013I 15 OPT 67.90511009978897 14 0.020001 NLP0013I 16 OPT 73.0759986484492 13 0.020001 NLP0013I 17 OPT 86.45049125587104 25 0.088005 Cbc0001I Search completed - best objective 73.03531252510086, took 144 iterations and 8 nodes (0.70 seconds) Cbc0032I Strong branching done 4 times (146 iterations), fathomed 0 nodes and fixed 0 variables Cbc0035I Maximum depth 2, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = 73.035313. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT 73.03531252510088 6 0.008001 MINLP solution: 73.03531253 (8 nodes, 0.75 seconds) Best possible: 73.03531253 Absolute gap: 1.4211e-14 Relative gap: 1.9458e-16 GAMS/Bonmin finished. --- Restarting execution --- synthes2.gms(83) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job synthes2.gms Stop 09/03/08 10:36:49 elapsed 0:00:00.985