--- Job ex1252a Start 09/02/08 15:20:45 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 --- ex1252a.gms(170) 2 Mb --- Starting execution: elapsed 0:00:00.004 --- ex1252a.gms(165) 3 Mb --- Generating MINLP model m --- ex1252a.gms(170) 5 Mb --- 35 rows 25 columns 94 non-zeroes --- 381 nl-code 36 nl-non-zeroes --- 9 discrete-columns --- ex1252a.gms(170) 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 65885.77971971285 31 0.052004 NLP0013I 2 FAILED 120575.7574021081 3000 78.8969 NLP0014I * r1 OPT 125445.8815618848 385 0.80805 NLP0013I 4 OPT 96433.39336418519 17 0.028002 NLP0013I 5 FAILED 105675.8865019401 3000 65.7841 NLP0014I r1 FAILED 127715.4702246976 3000 4.21626 NLP0013I 7 OPT 87940.17052638522 27 0.044003 NLP0013I 8 OPT 65885.77971974712 47 0.100006 NLP0013I 9 OPT 65885.77972326022 26 0.044003 NLP0013I 10 OPT 77287.76258101253 25 0.060004 NLP0013I 11 OPT 73865.98913901151 15 0.028001 NLP0013I 12 OPT 77013.45495517843 15 0.032002 NLP0013I 13 OPT 68675.22385282707 69 0.14801 NLP0013I 14 FAILED 88961.20851983997 3000 122.524 NLP0014I * r1 OPT 124939.1973054902 375 1.02806 NLP0013I 16 OPT 65885.77971975142 9 0.016001 NLP0013I 17 OPT 66152.21972000488 29 0.048003 NLP0013I 18 OPT 94908.10718470873 34 0.060004 NLP0013I 19 OPT 66039.32576268268 31 0.072005 NLP0013I 20 OPT 109602.4231590819 21 0.032002 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 65885.8 (273.99 seconds) NLP0012I Num Status Obj It time NLP0013I 21 OPT 96433.39336418519 17 0.028001 NLP0013I 22 OPT 124939.1973053776 2070 44.4188 NLP0013I 23 OPT 125445.8815619086 113 0.232015 NLP0013I 24 OPT 124939.1973053776 2070 44.3788 NLP0013I 25 OPT 124939.1973058002 786 2.59616 NLP0013I 26 OPT 125271.4555237503 1756 19.2892 NLP0013I 27 OPT 125314.9013579191 939 1.80011 NLP0013I 28 INFEAS 124043.3616535081 47 0.120007 NLP0013I 29 OPT 128664.6621175269 965 1.83211 NLP0013I 30 OPT 128664.6621175269 965 1.83612 NLP0013I 31 FAILED 128826.1999073452 3000 7.9845 NLP0014I * r1 OPT 128826.1999067192 751 1.38009 NLP0013I 33 INFEAS 131836.9376613882 42 0.108007 NLP0013I 34 OPT 150862.9023187077 2551 35.7342 NLP0013I 35 OPT 151120.5121827472 1177 7.35246 NLP0013I 36 OPT 151127.6809448189 505 2.72417 NLP0013I 37 OPT 134263.5853252004 2348 8.85655 NLP0013I 38 OPT 134263.5853277412 721 1.90012 NLP0013I 39 FAILED 134949.3460414572 3000 47.267 NLP0014I r1 FAILED 134412.797373431 3000 41.3066 NLP0012I Num Status Obj It time NLP0013I 41 INFEAS 173960.6862752848 41 0.104006 NLP0013I 42 OPT 134263.5853252029 1236 7.20045 NLP0012I Num Status Obj It time NLP0013I 1 OPT 134263.5853246767 6 0.012001 Cbc0004I Integer solution of 134264 found after 18905 iterations and 15 nodes (552.47 seconds) Restoration phase is called at point that is almost feasible, with constraint violation 5.767695e-14. Abort. NLP0013I 43 FAILED 124939.1973059216 898 2.67617 NLP0014I * r1 OPT 125301.3253006517 1058 2.96819 NLP0013I 45 OPT 124939.1896095649 1016 2.51216 NLP0013I 46 INFEAS 124043.3616535079 92 0.236014 NLP0013I 47 OPT 134263.5853227612 1796 4.22426 NLP0013I 48 OPT 147264.9605241402 656 1.31608 NLP0013I 49 OPT 125445.8815619086 113 0.228014 NLP0013I 50 OPT 125445.8815618871 28 0.044003 NLP0013I 51 INFEAS 131020.8101939714 28 0.068004 NLP0013I 52 OPT 124939.1973053838 35 0.068005 NLP0013I 53 OPT 134471.5605003779 21 0.040002 NLP0013I 54 OPT 124939.1973053878 15 0.024002 NLP0013I 55 OPT 125187.4173579175 35 0.056003 NLP0013I 56 OPT 134263.5854048179 37 0.068004 NLP0013I 57 OPT 124939.1973070468 2490 42.8907 NLP0013I 58 OPT 124939.1973053776 668 1.30408 NLP0013I 59 OPT 124939.197531345 318 0.780049 NLP0013I 60 OPT 125063.2872826124 255 0.544034 NLP0012I Num Status Obj It time NLP0013I 61 OPT 134263.5853252029 501 1.04407 NLP0013I 62 OPT 124939.1973053806 454 0.848053 NLP0013I 63 FAILED 125187.4173595262 3000 8.37652 NLP0014I * r1 OPT 126259.8923479469 834 1.95212 NLP0013I 65 OPT 134263.5853252029 333 0.744047 NLP0013I 66 INFEAS 189963.9741037994 41 0.104006 NLP0013I 67 FAILED 114489.6941780715 3000 6.27239 NLP0014I * r1 OPT 125445.8815618848 385 0.80005 NLP0013I 69 FAILED 122287.8689385395 3000 97.9821 NLP0014I * r1 OPT 134471.5605004671 1155 2.18814 NLP0013I 71 INFEAS 148830.0523331239 49 0.128008 Restoration phase is called at point that is almost feasible, with constraint violation 8.937434e-14. Abort. NLP0013I 72 FAILED 141412.9210956852 2322 29.8379 NLP0014I * r1 OPT 141412.9210956751 219 0.424027 NLP0013I 74 OPT 134263.5853251819 781 1.75211 NLP0013I 75 OPT 125271.4549370086 1954 17.3931 NLP0013I 76 OPT 127830.044550512 1178 17.9531 NLP0013I 77 INFEAS 124043.3616535079 72 0.188011 NLP0013I 78 OPT 153510.5698607366 2766 4.53628 NLP0013I 79 OPT 129686.5600993933 961 2.71217 NLP0013I 80 OPT 131564.5729390495 214 0.440028 NLP0013I 2 OPT 131564.5729385292 7 0.012001 Cbc0004I Integer solution of 131565 found after 39463 iterations and 48 nodes (808.24 seconds) NLP0012I Num Status Obj It time NLP0013I 81 INFEAS 129594.8734720265 43 0.108006 NLP0013I 82 OPT 128893.7410147816 1465 3.2482 NLP0013I 3 OPT 128893.741012841 7 0.012001 Cbc0004I Integer solution of 128894 found after 40971 iterations and 50 nodes (811.61 seconds) NLP0013I 83 OPT 125271.4549361864 37 0.064004 NLP0013I 84 OPT 131770.0456496001 36 0.068004 NLP0013I 85 OPT 125314.9013565346 22 0.044003 NLP0013I 86 OPT 150862.902319208 32 0.060004 NLP0013I 87 INFEAS 124043.3616535075 20 0.044003 NLP0013I 88 OPT 128664.6621166939 24 0.052003 NLP0013I 89 FAILED 125323.6301157437 3000 43.5947 NLP0014I * r1 OPT 125271.454936166 2372 25.7096 NLP0013I 91 INFEAS 124043.3616535079 89 0.232015 NLP0013I 92 OPT 153510.569735663 505 1.94812 NLP0013I 93 OPT 131770.0456495929 341 0.692043 NLP0013I 94 OPT 128692.583250703 22 0.044003 NLP0013I 95 OPT 128893.7410135186 26 0.048003 NLP0013I 96 INFEAS 131836.9376613882 24 0.052003 NLP0013I 97 INFEAS 129594.9118754317 28 0.072005 Cbc0001I Search completed - best objective 128893.741012841, took 44549 iterations and 64 nodes (884.35 seconds) Cbc0032I Strong branching done 10 times (7320 iterations), fathomed 0 nodes and fixed 1 variables Cbc0035I Maximum depth 10, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = 128893.741013. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT 128893.741012841 7 0.004 MINLP solution: 128893.741 (64 nodes, 884.42 seconds) Best possible: 128893.741 Absolute gap: 1.4552e-11 Relative gap: 1.129e-16 GAMS/Bonmin finished. --- Restarting execution --- ex1252a.gms(170) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ex1252a.gms Stop 09/02/08 15:35:31 elapsed 0:14:46.667