--- Job ortez Start 09/03/08 02:46:09 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 --- ortez.gms(230) 2 Mb --- Starting execution: elapsed 0:00:00.005 --- ortez.gms(225) 3 Mb --- Generating MINLP model m --- ortez.gms(230) 5 Mb --- 75 rows 88 columns 269 non-zeroes --- 373 nl-code 54 nl-non-zeroes --- 18 discrete-columns --- ortez.gms(230) 3 Mb --- Executing BONMIN: elapsed 0:00:00.009 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 -13803.49317428956 28 0.052003 NLP0013I 2 OPT -13569.80218482447 36 0.076005 NLP0013I 3 OPT -11587.26443363403 31 0.056004 Restoration phase is called at point that is almost feasible, with constraint violation 1.034964e-13. Abort. NLP0013I 4 FAILED -12715.33976024669 40 0.076004 NLP0014I * r1 OPT -12715.33976024671 30 0.056004 NLP0013I 6 OPT -13256.45834524223 26 0.052003 NLP0013I 7 OPT -13592.54167515404 22 0.036002 NLP0013I 8 OPT -11621.30898314539 25 0.044003 NLP0013I 9 OPT -12729.46111761538 36 0.060004 NLP0013I 10 OPT -13311.83421583862 25 0.040003 NLP0013I 11 OPT -13776.79880317197 32 0.056004 NLP0013I 12 OPT -11760.2006928121 28 0.048003 NLP0013I 13 OPT -12781.84693355201 24 0.044003 NLP0013I 14 OPT -13750.10443208647 30 0.056003 NLP0013I 15 OPT -13767.31971328433 29 0.068005 NLP0013I 16 INFEAS -8754.424290862362 40 0.104006 NLP0013I 17 OPT -13767.31971328433 29 0.064004 NLP0013I 18 INFEAS -8693.570769508548 41 0.104007 NLP0013I 19 OPT -10183.8499875571 146 1.82011 NLP0013I 20 OPT -10183.8499875571 146 1.81611 NLP0012I Num Status Obj It time NLP0013I 21 OPT -9716.036756469413 137 0.292019 NLP0013I 22 INFEAS -4910.867441081675 44 0.108007 NLP0013I 23 OPT -9716.036756469413 137 0.316019 NLP0013I 24 OPT -9716.036762030966 58 0.116008 Restoration phase is called at point that is almost feasible, with constraint violation 5.375168e-14. Abort. NLP0013I 25 FAILED -9716.036762028614 73 0.420026 NLP0014I * r1 OPT -9716.036762031088 63 0.116007 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible -9716.04 (6.08 seconds) NLP0013I 27 OPT -9716.03676203977 131 0.296018 NLP0013I 28 OPT -9659.549987577881 89 0.188012 NLP0013I 29 OPT -9591.856329639932 188 0.400025 NLP0013I 30 OPT -8448.701349039975 102 0.224014 NLP0013I 31 OPT -9629.403008937292 93 0.208013 Restoration phase is called at point that is almost feasible, with constraint violation 1.007414e-13. Abort. NLP0013I 32 FAILED -9599.256030296639 77 0.16801 NLP0014I * r1 OPT -9599.256030184964 218 1.19607 NLP0013I 34 OPT -8441.039721693041 98 0.208013 NLP0013I 35 OPT -9561.947691613062 83 0.180011 NLP0013I 36 OPT -9532.039053347971 134 0.548035 NLP0013I 37 OPT -9532.039053347959 77 0.17201 NLP0012I Num Status Obj It time NLP0013I 1 OPT -9532.03905334817 52 0.936059 Cbc0004I Integer solution of -9532.04 found after 919 iterations and 6 nodes (10.81 seconds) NLP0013I 38 OPT -8382.346527815957 99 0.292018 NLP0013I 39 OPT -8418.438304912241 72 0.15201 NLP0013I 40 OPT -7282.823413101287 84 0.176011 Restoration phase is called at point that is almost feasible, with constraint violation 4.500050e-11. Abort. NLP0012I Num Status Obj It time NLP0013I 41 FAILED -7288.469934110663 151 0.352022 NLP0014I * r1 OPT -7288.469934089163 115 0.224014 NLP0013I 43 OPT -9716.036762031035 58 0.120007 NLP0013I 44 OPT -9659.549987482911 69 0.140009 Restoration phase is called at point that is almost feasible, with constraint violation 2.050879e-12. Abort. NLP0013I 45 FAILED -9629.403008926802 142 2.69217 NLP0014I * r1 OPT -9629.403008937232 77 0.152009 NLP0013I 47 OPT -9561.947691613068 77 0.244015 NLP0013I 48 OPT -9532.039053347959 59 0.120008 NLP0013I 49 OPT -8382.346527835123 132 0.268017 Restoration phase is called at point that is almost feasible, with constraint violation 3.198499e-13. Abort. NLP0013I 50 FAILED -8418.438304912162 82 0.176011 NLP0014I * r1 OPT -8418.438304910824 77 0.16401 NLP0013I 52 OPT -7282.823413089443 102 0.232014 NLP0013I 53 OPT -7288.469934089163 74 0.168011 Cbc0001I Search completed - best objective -9532.03905334817, took 2014 iterations and 19 nodes (16.49 seconds) Cbc0032I Strong branching done 12 times (1509 iterations), fathomed 0 nodes and fixed 3 variables Cbc0035I Maximum depth 5, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = -9532.039053. Resolve with fixed discrete variables to get dual values. Restoration phase is called at point that is almost feasible, with constraint violation 5.660661e-14. Abort. NLP0012I Num Status Obj It time NLP0013I 1 FAILED -9532.039053348199 48 0.216013 NLP0014I * r1 OPT -9532.039053346911 52 0.312019 MINLP solution: -9532.039053 (19 nodes, 17.08 seconds) Best possible: -9532.039053 Absolute gap: 1.2587e-09 Relative gap: 1.3205e-13 GAMS/Bonmin finished. --- Restarting execution --- ortez.gms(230) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ortez.gms Stop 09/03/08 02:46:26 elapsed 0:00:17.301