--- Job synthes1 Start 09/03/08 10:36:47 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 --- synthes1.gms(65) 2 Mb --- Starting execution: elapsed 0:00:00.003 --- synthes1.gms(60) 3 Mb --- Generating MINLP model m --- synthes1.gms(65) 5 Mb --- 7 rows 7 columns 23 non-zeroes --- 83 nl-code 6 nl-non-zeroes --- 3 discrete-columns --- synthes1.gms(65) 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 ****************************************************************************** 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.7592843922105672 9 0.016001 NLP0013I 2 OPT 5.171320486031369 22 0.032002 NLP0013I 3 OPT 6.009758908990285 9 0.012 NLP0013I 4 OPT 3.820886938810737 22 0.032002 NLP0013I 5 OPT 7.092731703175307 14 0.020002 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0.759284 (0.10 seconds) NLP0013I 6 OPT 5.171320486031369 22 0.032002 NLP0013I 7 OPT 7.092731703173553 20 0.020001 NLP0012I Num Status Obj It time NLP0013I 1 OPT 7.092731703156123 21 0.028002 Cbc0004I Integer solution of 7.09273 found after 42 iterations and 2 nodes (0.18 seconds) NLP0013I 8 OPT 10.00000000001 25 0.036002 NLP0013I 9 OPT 6.009758908990285 9 0.012001 NLP0013I 2 OPT 6.009758908949022 19 0.080005 Cbc0004I Integer solution of 6.00976 found after 76 iterations and 4 nodes (0.31 seconds) Cbc0001I Search completed - best objective 6.009758908949022, took 76 iterations and 4 nodes (0.31 seconds) Cbc0032I Strong branching done 2 times (67 iterations), fathomed 0 nodes and fixed 0 variables Cbc0035I Maximum depth 1, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = 6.009759. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT 6.009758908949022 19 0.028002 MINLP solution: 6.009758909 (4 nodes, 0.35 seconds) Best possible: 6.009758909 Absolute gap: 0 Relative gap: 0 GAMS/Bonmin finished. --- Restarting execution --- synthes1.gms(65) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job synthes1.gms Stop 09/03/08 10:36:48 elapsed 0:00:00.397