--- Job st_e35 Start 09/03/08 09:32:12 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 --- st_e35.gms(174) 2 Mb --- Starting execution: elapsed 0:00:00.003 --- st_e35.gms(169) 3 Mb --- Generating MINLP model m --- st_e35.gms(174) 5 Mb --- 40 rows 33 columns 131 non-zeroes --- 301 nl-code 16 nl-non-zeroes --- 7 discrete-columns --- st_e35.gms(174) 3 Mb --- Executing BONMIN: elapsed 0:00:00.006 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 106660.8896144509 69 0.15601 Restoration phase is called at point that is almost feasible, with constraint violation 7.526706e-12. Abort. NLP0013I 2 FAILED 23027.41609223366 39 0.088006 NLP0014I * r1 OPT 150862.1071892304 199 0.432027 NLP0013I 4 OPT 22203.26201772255 79 0.140009 NLP0013I 5 OPT 22203.26690701777 48 0.104006 NLP0013I 6 OPT 23027.4170010774 64 0.128008 NLP0013I 7 OPT 51953.47178876594 54 0.116008 NLP0013I 8 OPT 53574.3129843326 75 0.16801 NLP0013I 9 OPT 301187.6729036882 112 0.31202 NLP0013I 10 OPT 56547.73474184932 45 0.100006 NLP0013I 11 OPT 22203.26230657128 47 0.112007 Restoration phase is called at point that is almost feasible, with constraint violation 4.651548e-11. Abort. NLP0013I 12 FAILED 29514.94788869508 50 0.168011 NLP0014I * r1 OPT 125359.7922455346 50 0.128008 NLP0013I 14 OPT 21355.21653499479 49 0.108006 NLP0013I 15 OPT 27955.21654338743 41 0.092006 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 106661 (2.21 seconds) NLP0013I 16 OPT 56547.73474184932 45 0.100006 NLP0013I 17 OPT 55415.20012963629 36 0.072004 NLP0013I 18 OPT 55614.47383895564 114 0.236015 NLP0013I 19 OPT 61760.68021263979 39 0.096006 NLP0013I 20 OPT 55614.47383895564 114 0.236015 NLP0012I Num Status Obj It time NLP0013I 21 OPT 63057.27398975236 52 0.116007 NLP0013I 22 OPT 63814.45229018142 42 0.080005 NLP0013I 23 OPT 71468.09705191106 35 0.080005 NLP0012I Num Status Obj It time NLP0013I 1 OPT 71468.69377647756 52 0.112007 NLP0013I 2 OPT 71468.69377647756 52 0.112007 Cbc0004I Integer solution of 71468.7 found after 324 iterations and 6 nodes (3.46 seconds) NLP0013I 24 OPT 123778.934236802 39 0.080005 Restoration phase is called at point that is almost feasible, with constraint violation 1.720730e-11. Abort. NLP0013I 25 FAILED 122273.6290712941 52 0.100006 NLP0014I * r1 OPT 122273.6189566792 94 0.272017 Restoration phase is called at point that is almost feasible, with constraint violation 1.134004e-11. Abort. NLP0013I 27 FAILED 57214.45228837593 57 0.120008 NLP0014I * r1 OPT 61829.72588888984 152 0.32802 NLP0013I 29 OPT 68413.18848795498 39 0.072005 NLP0013I 3 OPT 68413.1884878322 29 0.056003 Cbc0004I Integer solution of 68413.2 found after 648 iterations and 10 nodes (4.50 seconds) NLP0013I 30 OPT 117178.9342367043 27 0.060003 NLP0013I 31 OPT 61760.68021263979 39 0.096006 NLP0013I 32 OPT 66714.27688522855 71 0.152009 NLP0013I 33 OPT 75010.2426677265 58 0.128008 Restoration phase is called at point that is almost feasible, with constraint violation 8.323071e-12. Abort. NLP0013I 34 FAILED 96470.8777746077 125 0.268017 NLP0014I * r1 OPT 97953.93501945525 84 0.192012 Restoration phase is called at point that is almost feasible, with constraint violation 8.876079e-12. Abort. NLP0013I 36 FAILED 89870.87782115515 58 0.108007 NLP0014I * r1 OPT 89870.87777442062 127 0.340021 NLP0013I 38 OPT 79997.80671686091 50 0.100006 Cbc0001I Search completed - best objective 68413.1884878322, took 1104 iterations and 17 nodes (5.96 seconds) Cbc0032I Strong branching done 7 times (1016 iterations), fathomed 0 nodes and fixed 0 variables Cbc0035I Maximum depth 5, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = 68413.188488. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT 68413.18848783663 22 0.044002 MINLP solution: 68413.18849 (17 nodes, 6.17 seconds) Best possible: 68413.18849 Absolute gap: 4.4238e-09 Relative gap: 6.4663e-14 GAMS/Bonmin finished. --- Restarting execution --- st_e35.gms(174) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job st_e35.gms Stop 09/03/08 09:32:19 elapsed 0:00:06.242