--- Job ex1225 Start 09/02/08 15:19:47 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved *** License File has expired 1 days ago Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- ex1225.gms(69) 2 Mb --- Starting execution: elapsed 0:00:00.003 --- ex1225.gms(64) 3 Mb --- Generating MINLP model m --- ex1225.gms(69) 5 Mb --- 11 rows 9 columns 27 non-zeroes --- 28 nl-code 2 nl-non-zeroes --- 6 discrete-columns --- ex1225.gms(69) 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 ****************************************************************************** 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 29.77884400851897 13 0.020001 NLP0013I 2 OPT 29.77884400851896 6 0.008 NLP0013I 3 OPT 29.77884400851897 8 0.012001 NLP0013I 4 OPT 29.77884400886483 6 0.012001 NLP0013I 5 OPT 31.00000000006095 14 0.020001 NLP0013I 6 OPT 29.7788440086892 5 0.008 NLP0013I 7 INFEAS 58.65977974398198 21 0.052004 NLP0013I 8 OPT 29.7788440086892 5 0.008 NLP0013I 9 OPT 29.77884400851897 6 0.008001 NLP0013I 10 OPT 59.33333333334501 17 0.024001 NLP0013I 11 OPT 29.77884400851897 6 0.008001 NLP0013I 12 OPT 37.00000000004161 12 0.020001 NLP0013I 13 OPT 29.77884400897804 5 0.008001 NLP0013I 14 OPT 32.54050876034812 11 0.008 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 29.7788 (0.20 seconds) NLP0013I 15 OPT 29.77884400851897 6 0.008001 NLP0013I 16 OPT 29.7788440086918 5 0.004 NLP0013I 17 OPT 31.00000000001002 6 0.008001 NLP0013I 18 INFEAS 29.77884400849985 12 0.028002 NLP0013I 19 OPT 31.00000000011505 9 0.016001 NLP0012I Num Status Obj It time NLP0013I 1 OPT 31.0000001 2 0.004 Cbc0004I Integer solution of 31 found after 43 iterations and 5 nodes (0.28 seconds) NLP0013I 20 OPT 32.54050876047917 9 0.012001 NLP0012I Num Status Obj It time NLP0013I 21 OPT 37.00000000004 10 0.012001 NLP0013I 22 OPT 59.33333333334501 17 0.024001 Cbc0001I Search completed - best objective 31.0000001, took 79 iterations and 8 nodes (0.34 seconds) Cbc0032I Strong branching done 6 times (117 iterations), fathomed 0 nodes and fixed 1 variables Cbc0035I Maximum depth 3, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = 31.000000. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT 31 3 0.004001 MINLP solution: 31 (8 nodes, 0.36 seconds) Best possible: 31.0000001 Absolute gap: 1e-07 Relative gap: 3.2258e-09 GAMS/Bonmin finished. --- Restarting execution --- ex1225.gms(69) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ex1225.gms Stop 09/02/08 15:19:47 elapsed 0:00:00.401