--- Job util Start 09/03/08 16:42:18 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 --- util.gms(436) 2 Mb --- Starting execution: elapsed 0:00:00.006 --- util.gms(431) 3 Mb --- Generating MINLP model m --- util.gms(436) 5 Mb --- 168 rows 146 columns 467 non-zeroes --- 50 nl-code 10 nl-non-zeroes --- 28 discrete-columns --- util.gms(436) 3 Mb --- Executing BONMIN: elapsed 0:00:00.011 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 999.5538990475803 41 0.084006 NLP0013I 2 OPT 999.5538990475609 33 0.072004 NLP0013I 3 OPT 999.553899047561 35 0.084005 NLP0013I 4 OPT 999.5538990475609 27 0.060004 NLP0013I 5 OPT 999.553899047561 39 0.088006 NLP0013I 6 OPT 999.5538990475609 29 0.128008 NLP0013I 7 OPT 999.5538990475608 31 0.060004 NLP0013I 8 OPT 999.5538990475609 39 0.096006 NLP0013I 9 OPT 999.5538990475609 39 0.088005 NLP0013I 10 OPT 999.5538990475607 38 0.104007 NLP0013I 11 OPT 999.5538990475611 32 0.072004 NLP0013I 12 OPT 999.553899047561 35 0.084006 NLP0013I 13 OPT 999.553899047561 37 0.076004 NLP0013I 14 OPT 1007.237631904588 36 0.084005 NLP0013I 15 OPT 999.553899047551 34 0.080005 NLP0013I 16 OPT 999.5538990475513 35 0.092006 NLP0013I 17 OPT 1007.237631904588 30 0.068004 NLP0013I 18 OPT 999.5539268932656 30 0.060004 NLP0013I 19 OPT 999.5538990475609 39 0.092006 NLP0013I 20 OPT 999.5538990475609 53 0.136009 NLP0012I Num Status Obj It time NLP0013I 21 OPT 999.5538990475608 29 0.064004 Restoration phase is called at point that is almost feasible, with constraint violation 2.493663e-12. Abort. NLP0013I 22 FAILED 999.5538990475608 40 0.096006 NLP0014I * r1 OPT 999.5538990475605 46 0.092005 NLP0013I 24 OPT 999.5538990475605 19 0.040002 NLP0013I 25 OPT 999.553899047561 23 0.052003 NLP0013I 26 OPT 999.5538990475609 17 0.032002 NLP0013I 27 OPT 999.5538990475611 21 0.056004 NLP0013I 28 OPT 999.5538990475607 17 0.044003 NLP0013I 29 OPT 999.553899047561 20 0.052003 NLP0013I 30 OPT 999.5538990475609 26 0.076005 NLP0013I 31 OPT 999.5538990475607 19 0.052003 NLP0013I 32 OPT 999.5538990475605 20 0.056003 NLP0013I 33 OPT 999.553899047561 23 0.064004 NLP0013I 34 OPT 999.5538990475616 17 0.036003 NLP0013I 35 OPT 999.553899047561 19 0.040002 NLP0013I 36 OPT 999.5538990475609 16 0.036003 Restoration phase is called at point that is almost feasible, with constraint violation 2.004188e-12. Abort. NLP0013I 37 FAILED 999.5538990475608 16 0.040002 NLP0014I * r1 OPT 999.553899047561 47 0.104007 NLP0013I 39 OPT 999.5538990475611 22 0.068004 NLP0013I 40 OPT 999.553899047561 18 0.040003 NLP0012I Num Status Obj It time NLP0013I 41 OPT 999.5538990475613 18 0.044002 NLP0013I 42 OPT 999.5538990475612 17 0.040003 NLP0013I 43 OPT 999.553899047561 14 0.024001 NLP0013I 44 OPT 999.5538990475608 26 0.068004 NLP0013I 45 OPT 999.5538990475604 17 0.044003 NLP0013I 46 OPT 999.5538990475608 19 0.048003 NLP0013I 47 OPT 999.5539080591368 40 0.412025 NLP0013I 48 OPT 999.553899047561 24 0.076005 NLP0013I 49 OPT 999.5538990475613 27 0.076005 NLP0013I 50 OPT 999.5538990475608 19 0.052003 NLP0013I 51 OPT 999.5538990475609 21 0.060004 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 999.554 (3.75 seconds) NLP0013I 52 OPT 999.5538990480184 23 0.052003 NLP0013I 53 OPT 999.553899048104 25 0.052004 NLP0013I 54 OPT 999.5538990475513 23 0.040002 NLP0013I 55 OPT 999.5538990478603 24 0.208013 NLP0013I 56 OPT 999.5538990475795 36 0.088006 Restoration phase is called at point that is almost feasible, with constraint violation 1.790127e-12. Abort. NLP0013I 57 FAILED 999.5538990475551 27 0.280017 NLP0014I * r1 OPT 999.5538990475508 49 0.116008 NLP0013I 59 OPT 999.5538990475509 28 0.056003 NLP0013I 60 OPT 999.5538990475512 61 0.46803 Restoration phase is called at point that is almost feasible, with constraint violation 1.949464e-12. Abort. NLP0012I Num Status Obj It time NLP0013I 61 FAILED 999.5538990475507 48 0.132008 NLP0014I * r1 OPT 999.5538990475509 53 0.124008 NLP0013I 63 OPT 1000.699985456114 55 0.372023 NLP0013I 64 OPT 999.5539071675935 30 0.072004 Restoration phase is called at point that is almost feasible, with constraint violation 2.070966e-12. Abort. NLP0013I 65 FAILED 999.5538990475986 30 0.068005 NLP0014I * r1 OPT 999.5538990475482 33 0.224014 NLP0013I 67 OPT 999.553899047621 31 0.068004 NLP0013I 68 OPT 999.5538990476341 41 0.172011 NLP0013I 69 OPT 999.553899047551 51 0.348021 NLP0013I 70 OPT 1014.843933954506 70 1.16407 NLP0013I 71 OPT 999.553899057441 55 0.892056 NLP0013I 72 OPT 999.5538990475509 19 0.040002 NLP0013I 73 OPT 999.5538990476809 37 0.084005 NLP0013I 74 OPT 999.5538990475511 37 0.088005 NLP0013I 75 OPT 1009.964792181116 37 0.088006 NLP0013I 76 OPT 999.5538990475515 40 0.092006 NLP0013I 77 OPT 999.5538990476257 26 0.216013 NLP0013I 78 OPT 999.5538990475944 37 0.236015 NLP0013I 79 OPT 999.5538990475764 39 0.096006 NLP0013I 80 OPT 999.5538990477693 34 0.080005 NLP0012I Num Status Obj It time NLP0013I 81 OPT 999.553899047639 40 0.124008 NLP0013I 82 OPT 999.5538990475513 38 0.100006 NLP0013I 83 OPT 1015.990740564223 31 1.30008 NLP0013I 84 OPT 999.5538990477471 28 0.056004 NLP0013I 85 OPT 999.5538990475593 29 0.064004 NLP0013I 86 OPT 1001.846792089224 32 0.084005 NLP0013I 87 OPT 999.5538990891996 28 0.068005 NLP0013I 88 OPT 999.553899048259 31 0.072004 NLP0013I 89 OPT 999.5538990475512 34 0.080005 Restoration phase is called at point that is almost feasible, with constraint violation 9.163858e-12. Abort. NLP0013I 90 FAILED 999.5538990475543 24 0.056004 NLP0014I * r1 OPT 999.5538990574403 73 1.23208 NLP0013I 92 OPT 999.5538990475508 41 0.104006 NLP0013I 93 OPT 999.5538990475512 27 0.216014 NLP0013I 94 OPT 999.5538990475902 36 0.084005 NLP0013I 95 OPT 999.5538990475511 37 0.092006 NLP0013I 96 OPT 999.5538990475793 35 0.072005 NLP0013I 97 OPT 999.5538990475513 41 0.16001 NLP0013I 98 OPT 1010.301348845003 44 0.104006 NLP0013I 99 OPT 1010.301348845008 54 0.228015 NLP0012I Num Status Obj It time NLP0013I 1 OPT 1010.301348844655 8 0.020001 Cbc0004I Integer solution of 1010.3 found after 1673 iterations and 44 nodes (14.12 seconds) NLP0013I 100 OPT 999.55389904766 38 0.092006 NLP0012I Num Status Obj It time NLP0013I 101 OPT 999.5538990475509 48 0.352022 NLP0013I 102 OPT 999.5538990475511 41 0.244015 Restoration phase is called at point that is almost feasible, with constraint violation 2.383528e-12. Abort. NLP0013I 103 FAILED 999.5538990477769 29 0.068004 NLP0014I * r1 OPT 999.5538990476034 54 0.112007 NLP0013I 105 OPT 999.553899047865 31 0.068004 NLP0013I 106 OPT 999.553899047551 32 0.064004 NLP0013I 107 OPT 999.553899047551 35 0.084005 NLP0013I 108 OPT 999.5538990476739 31 0.076005 NLP0013I 109 OPT 1010.301348844843 34 0.088006 NLP0013I 110 OPT 1014.875789671261 53 0.140009 NLP0013I 111 OPT 1007.23763190737 21 0.052003 NLP0013I 112 OPT 1007.237631904588 30 0.096006 NLP0013I 113 OPT 1007.237631904588 33 0.088005 NLP0013I 114 OPT 1007.237631904588 35 0.072005 NLP0013I 115 OPT 1012.071120134482 32 0.068004 NLP0013I 116 OPT 1007.237631904588 39 0.084005 NLP0013I 117 OPT 1007.237631904589 41 0.252015 NLP0013I 118 OPT 1007.237631904588 36 0.084006 NLP0013I 119 OPT 1007.237631904588 34 0.076005 NLP0013I 120 OPT 1007.237631904588 33 0.064004 Restoration phase is called at point that is almost feasible, with constraint violation 1.355290e-11. Abort. NLP0012I Num Status Obj It time NLP0013I 121 FAILED 1007.237631904603 24 0.052003 NLP0014I * r1 OPT 1007.237631992955 56 0.116007 NLP0013I 123 OPT 1007.237631904609 32 0.224014 NLP0013I 124 OPT 1007.237631904588 42 0.128008 NLP0013I 125 OPT 1007.237631914474 46 0.500032 NLP0013I 126 OPT 1007.237631904589 38 0.244015 NLP0013I 127 OPT 1007.237631904626 31 0.076005 NLP0013I 128 OPT 1007.237631904588 28 0.064004 NLP0013I 129 OPT 1009.286684604019 31 0.068004 NLP0013I 130 OPT 1022.098738383327 52 0.108007 NLP0013I 131 OPT 1009.286684604197 30 0.068004 NLP0013I 2 OPT 1009.28668460383 8 0.020001 Cbc0004I Integer solution of 1009.29 found after 2790 iterations and 74 nodes (18.15 seconds) NLP0013I 132 OPT 1007.237631904588 30 0.068004 Cbc0011I Exiting as integer gap of 9.73279 less than 0 or 1% Cbc0001I Search completed - best objective 1009.28668460383, took 2820 iterations and 75 nodes (18.22 seconds) Cbc0032I Strong branching done 24 times (1332 iterations), fathomed 0 nodes and fixed 0 variables Cbc0035I Maximum depth 6, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = 1009.286685. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT 1009.28668460383 8 0.020002 MINLP solution: 1009.286685 (75 nodes, 18.33 seconds) Best possible: 1009.286685 Absolute gap: 2.2737e-13 Relative gap: 2.2528e-16 GAMS/Bonmin finished. --- Restarting execution --- util.gms(436) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job util.gms Stop 09/03/08 16:42:36 elapsed 0:00:18.578