--- Job ex3pb Start 09/02/08 16:22:50 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 --- ex3pb.gms(144) 2 Mb --- Starting execution: elapsed 0:00:00.073 --- ex3pb.gms(139) 3 Mb --- Generating MINLP model m --- ex3pb.gms(144) 5 Mb --- 32 rows 33 columns 100 non-zeroes --- 40 nl-code 5 nl-non-zeroes --- 8 discrete-columns --- ex3pb.gms(144) 3 Mb --- Executing BONMIN: elapsed 0:00:00.076 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 15.08219085997305 12 0.032002 NLP0013I 2 OPT 35.06158546681976 23 0.036002 NLP0013I 3 OPT 44.156151511345 11 0.020001 NLP0013I 4 OPT 44.15615151057895 11 0.016001 NLP0013I 5 OPT 35.06158546656093 11 0.016001 NLP0013I 6 OPT 73.67483084527012 37 0.088006 NLP0013I 7 OPT 24.71102710274835 15 0.020001 NLP0013I 8 OPT 56.55729683886406 21 0.032002 NLP0013I 9 OPT 45.79972486511033 21 0.032002 NLP0013I 10 OPT 30.66641135556883 29 0.044002 NLP0013I 11 OPT 19.47943113855354 7 0.012 NLP0013I 12 OPT 32.19972486168948 10 0.016001 NLP0013I 13 OPT 68.98613308285755 24 0.036003 NLP0013I 14 OPT 17.77506890832103 25 0.040002 NLP0013I 15 OPT 25.06705839626004 15 0.024002 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 15.0822 (0.45 seconds) NLP0013I 16 OPT 45.79972486511033 21 0.032002 NLP0013I 17 OPT 62.85122336000062 27 0.040002 NLP0013I 18 OPT 67.37288948879069 25 0.036003 NLP0013I 19 OPT 68.00974405110514 29 0.044002 NLP0012I Num Status Obj It time NLP0013I 1 OPT 68.0097440513556 6 0.012001 Cbc0004I Integer solution of 68.0097 found after 102 iterations and 4 nodes (0.62 seconds) NLP0013I 20 OPT 73.27798655438774 29 0.044003 NLP0012I Num Status Obj It time NLP0013I 21 OPT 76.41938407037017 31 0.048003 NLP0013I 22 OPT 71.94578940846134 25 0.036002 NLP0013I 23 OPT 56.55729683886406 21 0.032002 NLP0013I 24 OPT 73.67483084527012 32 0.044003 NLP0013I 25 OPT 68.98613308286357 25 0.036002 Cbc0001I Search completed - best objective 68.0097440513556, took 265 iterations and 10 nodes (0.86 seconds) Cbc0032I Strong branching done 7 times (260 iterations), fathomed 0 nodes and fixed 0 variables Cbc0035I Maximum depth 3, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = 68.009744. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT 68.0097440513556 6 0.008 MINLP solution: 68.00974405 (10 nodes, 0.91 seconds) Best possible: 68.00974405 Absolute gap: 0 Relative gap: 0 GAMS/Bonmin finished. --- Restarting execution --- ex3pb.gms(144) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ex3pb.gms Stop 09/02/08 16:22:51 elapsed 0:00:01.019