--- Job ex1252 Start 09/02/08 15:20:38 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 --- ex1252.gms(192) 2 Mb --- Starting execution: elapsed 0:00:00.004 --- ex1252.gms(187) 3 Mb --- Generating MINLP model m --- ex1252.gms(192) 5 Mb --- 44 rows 40 columns 118 non-zeroes --- 381 nl-code 36 nl-non-zeroes --- 15 discrete-columns --- ex1252.gms(192) 3 Mb --- Executing BONMIN: elapsed 0:00:00.007 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 65885.7797197141 26 0.044002 NLP0013I 2 OPT 65885.77971976231 18 0.032002 NLP0013I 3 OPT 65885.77971976233 20 0.032002 NLP0013I 4 OPT 65885.7797197623 20 0.028002 NLP0013I 5 OPT 65885.77971976231 19 0.024002 NLP0013I 6 INFEAS 139851.1371320787 28 0.072005 NLP0013I 7 OPT 96433.39336419941 32 0.056003 NLP0013I 8 OPT 96433.39336419941 32 0.052003 NLP0013I 9 INFEAS 142517.232752102 24 0.064004 NLP0013I 10 OPT 96433.39336421399 28 0.048003 NLP0013I 11 OPT 96433.39336421399 28 0.048003 NLP0013I 12 OPT 111776.4749759342 37 0.068004 NLP0013I 13 OPT 96433.39336421785 36 0.068004 NLP0013I 14 INFEAS 152988.3090535029 30 0.072004 NLP0013I 15 OPT 96433.39336419938 35 0.064004 NLP0013I 16 OPT 96433.39336419938 35 0.064004 NLP0013I 17 INFEAS 145195.5037939653 21 0.056004 NLP0013I 18 OPT 96433.39336422441 41 0.084005 NLP0013I 19 OPT 96433.39336422441 41 0.084005 NLP0013I 20 INFEAS 144132.8875331867 28 0.072005 NLP0012I Num Status Obj It time NLP0013I 21 OPT 124939.1973054244 31 0.060003 NLP0013I 22 OPT 124939.1973054244 31 0.056004 NLP0013I 23 OPT 129686.5600994324 40 0.088006 NLP0013I 24 OPT 124939.1973054244 38 0.072004 NLP0013I 25 OPT 124939.1973054245 37 0.064004 NLP0013I 26 OPT 124939.1973113076 36 0.260017 NLP0013I 27 OPT 124939.1973059991 26 0.048003 NLP0013I 28 OPT 134471.560500435 22 0.044003 NLP0013I 29 OPT 124939.1973054244 36 0.068004 NLP0013I 30 OPT 124939.1973054565 34 0.060004 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 124939 (1.94 seconds) NLP0013I 31 OPT 124939.1973059991 26 0.048003 NLP0013I 32 OPT 124939.1973059839 21 0.032002 NLP0013I 33 OPT 124939.1973124287 29 0.056003 NLP0013I 34 OPT 125063.287281244 27 0.048003 NLP0013I 35 OPT 125063.2872813841 29 0.056004 NLP0013I 36 OPT 131564.5729390749 27 0.052003 NLP0013I 37 OPT 125063.2872813841 29 0.052003 NLP0013I 38 OPT 143555.0884764986 22 0.040003 NLP0012I Num Status Obj It time NLP0013I 1 OPT 143555.0884763392 33 0.088005 Cbc0004I Integer solution of 143555 found after 321 iterations and 6 nodes (2.42 seconds) NLP0013I 39 OPT 125324.6582015566 30 0.064004 NLP0013I 40 OPT 125324.6582013502 39 0.076005 NLP0012I Num Status Obj It time NLP0013I 41 OPT 128893.7410135216 26 0.040003 NLP0013I 42 OPT 125324.6582013739 54 0.128008 NLP0013I 43 OPT 133826.3172481345 59 0.120008 NLP0013I 44 OPT 131564.5729390749 27 0.048003 NLP0013I 2 OPT 131564.5729390389 29 0.068004 Cbc0004I Integer solution of 131565 found after 378 iterations and 8 nodes (2.97 seconds) NLP0013I 45 OPT 134263.5853252258 47 0.080005 NLP0013I 46 OPT 124939.1973054135 24 0.044003 NLP0013I 47 OPT 125063.287281244 27 0.048003 NLP0013I 48 OPT 125063.2872815314 27 0.048003 NLP0013I 49 OPT 125493.2210476707 25 0.048003 NLP0013I 50 OPT 131564.5729391196 23 0.044003 NLP0013I 51 OPT 143555.0884767938 22 0.040002 NLP0013I 52 OPT 134263.5853301378 112 1.48409 NLP0013I 53 OPT 129686.5601103477 47 0.096006 NLP0013I 54 OPT 130720.891795679 25 0.040003 NLP0013I 55 OPT 134471.5605004077 58 0.120008 NLP0013I 56 OPT 131123.7758553472 26 0.048003 NLP0013I 57 OPT 131123.7758553231 45 0.092005 NLP0013I 3 OPT 131123.7758552875 14 0.028002 Cbc0004I Integer solution of 131124 found after 886 iterations and 21 nodes (5.24 seconds) NLP0013I 58 OPT 134751.3263666197 20 0.024002 NLP0013I 59 OPT 134471.560500435 22 0.044002 NLP0013I 60 OPT 125324.6582013739 54 0.128008 NLP0012I Num Status Obj It time NLP0013I 61 INFEAS 124043.3616535458 25 0.064004 NLP0013I 62 OPT 128893.7410135154 25 0.044003 NLP0013I 63 OPT 133826.3172481345 59 0.120008 NLP0013I 64 OPT 125493.2210476693 61 0.108007 NLP0013I 65 INFEAS 124043.3616535483 27 0.068004 NLP0013I 66 OPT 131452.9683483314 30 0.060004 NLP0013I 67 OPT 138695.2752576167 24 0.048003 NLP0013I 68 OPT 128893.7410135163 25 0.040002 NLP0013I 4 OPT 128893.7410135274 14 0.020001 Cbc0004I Integer solution of 128894 found after 1258 iterations and 32 nodes (6.02 seconds) Cbc0001I Search completed - best objective 128893.7410135274, took 1258 iterations and 32 nodes (6.02 seconds) Cbc0032I Strong branching done 15 times (951 iterations), fathomed 0 nodes and fixed 5 variables Cbc0035I Maximum depth 8, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = 128893.741014. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT 128893.7410135274 14 0.024002 MINLP solution: 128893.741 (32 nodes, 6.08 seconds) Best possible: 128893.741 Absolute gap: 0 Relative gap: 0 GAMS/Bonmin finished. --- Restarting execution --- ex1252.gms(192) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ex1252.gms Stop 09/02/08 15:20:44 elapsed 0:00:06.180