--- Job spring Start 09/03/08 09:31:27 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 --- spring.gms(71) 2 Mb --- Starting execution: elapsed 0:00:00.003 --- spring.gms(66) 3 Mb --- Generating MINLP model m --- spring.gms(71) 5 Mb --- 9 rows 18 columns 44 non-zeroes --- 116 nl-code 14 nl-non-zeroes --- 12 discrete-columns --- spring.gms(71) 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.8320251370245861 51 0.14801 NLP0013I 2 OPT 0.8320251370288844 13 0.028002 NLP0013I 3 INFEAS 0.9530905346659787 75 0.184011 NLP0013I 4 OPT 0.8320251370288844 13 0.020001 NLP0013I 5 OPT 0.8320251370288839 11 0.016001 NLP0013I 6 OPT 6.021970293958535 21 0.032002 NLP0013I 7 OPT 0.832025137028884 12 0.020001 NLP0013I 8 OPT 2.923472954089423 21 0.036003 NLP0013I 9 OPT 0.8320251370288907 12 0.020001 NLP0013I 10 OPT 1.746008079765533 20 0.032002 NLP0013I 11 OPT 0.8320251370289279 12 0.016001 NLP0013I 12 OPT 1.194960863728262 20 0.032002 NLP0013I 13 OPT 0.8320251370288849 13 0.020001 NLP0013I 14 OPT 0.9278402081202879 22 0.032002 NLP0013I 15 OPT 0.8320251370288843 13 0.020002 NLP0013I 16 OPT 0.8485210574957678 24 0.036002 NLP0013I 17 OPT 0.8320251370288841 13 0.020001 NLP0013I 18 OPT 0.8366843796014301 21 0.032002 NLP0013I 19 OPT 0.8320251370286137 21 0.032002 NLP0013I 20 OPT 0.9026642549080305 22 0.036003 NLP0012I Num Status Obj It time NLP0013I 21 OPT 0.8320546154217634 15 0.020001 NLP0013I 22 OPT 0.8334607266877639 17 0.020001 NLP0013I 23 OPT 0.8320251370288846 11 0.020002 NLP0013I 24 OPT 1.133498963345138 20 0.032002 NLP0013I 25 OPT 0.8320251370288848 19 0.028001 NLP0013I 26 INFEAS 0.9530905346728851 268 0.632039 NLP0013I 27 OPT 0.8320251370288848 19 0.028002 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0.832025 (1.48 seconds) NLP0013I 28 OPT 0.8320251370288798 16 0.024002 NLP0013I 29 OPT 0.8320251370288836 14 0.040002 NLP0013I 30 OPT 0.832025137028884 15 0.056003 NLP0013I 31 OPT 0.8320251370288848 12 0.020001 NLP0013I 32 OPT 0.8320251370288844 17 0.024002 NLP0013I 33 OPT 0.8320251370284477 13 0.016001 NLP0013I 34 OPT 0.9278402080963921 21 0.028002 NLP0013I 35 OPT 1.133498963298087 18 0.028002 NLP0013I 36 INFEAS 1.118001992522777 41 0.084005 NLP0013I 37 OPT 1.14250982556278 22 0.036003 NLP0012I Num Status Obj It time NLP0013I 1 OPT 1.142509748568838 5 0.008 Cbc0004I Integer solution of 1.14251 found after 221 iterations and 10 nodes (1.86 seconds) NLP0013I 38 OPT 1.194960863735914 24 0.040003 NLP0013I 39 OPT 1.746008079765528 34 0.068004 NLP0013I 40 OPT 2.923472954157866 20 0.032002 NLP0012I Num Status Obj It time NLP0013I 41 OPT 6.021970293820213 50 0.100007 NLP0013I 42 OPT 0.8320251370288838 13 0.020001 NLP0013I 43 OPT 0.8366843796014306 12 0.016001 NLP0013I 44 INFEAS 0.7753696407240279 57 0.120007 NLP0013I 45 OPT 0.8462456656631542 13 0.016001 NLP0013I 2 OPT 0.8462456653059455 7 0.008 Cbc0004I Integer solution of 0.846246 found after 444 iterations and 18 nodes (2.30 seconds) NLP0013I 46 OPT 0.8485210574771492 10 0.012 NLP0013I 47 OPT 0.9026642548835285 16 0.020001 Cbc0001I Search completed - best objective 0.8462456653059455, took 470 iterations and 20 nodes (2.34 seconds) Cbc0032I Strong branching done 12 times (716 iterations), fathomed 0 nodes and fixed 2 variables Cbc0035I Maximum depth 8, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = 0.846246. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT 0.8462456653059455 7 0.008 MINLP solution: 0.8462456653 (20 nodes, 2.51 seconds) Best possible: 0.8462456653 Absolute gap: 0 Relative gap: 0 GAMS/Bonmin finished. --- Restarting execution --- spring.gms(71) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job spring.gms Stop 09/03/08 09:31:29 elapsed 0:00:02.562