--- Job fac2 Start 09/02/08 16:23:02 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 --- fac2.gms(192) 2 Mb --- Starting execution: elapsed 0:00:00.004 --- fac2.gms(187) 3 Mb --- Generating MINLP model m --- fac2.gms(192) 5 Mb --- 34 rows 67 columns 217 non-zeroes --- 558 nl-code 54 nl-non-zeroes --- 12 discrete-columns --- fac2.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 255334502.6544959 17 0.036002 NLP0013I 2 OPT 255339465.7068748 29 0.072005 NLP0013I 3 OPT 291597549.9983355 23 0.044003 Restoration phase is called at point that is almost feasible, with constraint violation 1.007581e-13. Abort. NLP0013I 4 FAILED 255336390.4446997 20 0.044002 NLP0014I * r1 OPT 255336390.4453422 24 0.052003 NLP0013I 6 OPT 255345567.039074 27 0.056003 NLP0013I 7 OPT 255341481.5300555 35 0.072005 NLP0013I 8 OPT 270081749.534077 18 0.036002 NLP0013I 9 OPT 255335510.8833817 38 0.084006 NLP0013I 10 OPT 255341481.53005 31 0.060003 NLP0013I 11 OPT 768026093.4071289 20 0.040002 NLP0013I 12 OPT 257646828.2968591 6 0.012001 NLP0013I 13 OPT 399055089.2989058 21 0.044003 NLP0013I 14 OPT 257421325.5450355 7 0.016001 NLP0013I 15 OPT 371916613.745155 21 0.044002 NLP0013I 16 OPT 257365388.7140128 9 0.020002 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 2.55335e+08 (0.71 seconds) NLP0013I 17 OPT 257646828.2968591 6 0.016001 NLP0013I 18 OPT 259733663.4960748 6 0.012 NLP0013I 19 OPT 261764566.2374927 5 0.012001 NLP0013I 20 OPT 261769529.1317653 25 0.052003 NLP0012I Num Status Obj It time NLP0013I 21 OPT 261779705.2323081 47 0.096006 NLP0013I 22 OPT 298035714.622189 45 0.096006 NLP0013I 23 OPT 261775630.024415 29 0.060003 NLP0013I 24 OPT 276525149.5965238 27 0.056004 NLP0013I 25 OPT 261772898.5578926 28 0.052003 NLP0013I 26 OPT 261787298.4678233 29 0.060004 NLP0013I 27 INFEAS 488253459.4504286 37 0.096006 NLP0013I 28 OPT 298057806.3064227 48 0.232015 NLP0013I 29 OPT 298057806.3064227 48 0.236014 NLP0013I 30 OPT 298035714.6221875 26 0.052004 NLP0013I 31 OPT 276529483.8840526 25 0.044002 NLP0013I 32 OPT 328946272.7699573 28 0.056004 NLP0013I 33 INFEAS 293118516.5161281 29 0.072004 NLP0013I 34 OPT 328946272.7699573 28 0.056004 NLP0013I 35 OPT 331861029.7507733 47 0.180011 NLP0013I 36 INFEAS 760203229.1150644 32 0.080005 NLP0013I 37 OPT 331861029.7507733 47 0.188012 NLP0012I Num Status Obj It time NLP0013I 1 OPT 331861029.7508334 7 0.008001 NLP0013I 2 OPT 331861029.7508334 7 0.016001 Cbc0004I Integer solution of 3.31861e+08 found after 273 iterations and 8 nodes (2.55 seconds) NLP0013I 38 OPT 298028246.9114476 29 0.060004 NLP0013I 39 OPT 298033322.7129155 29 0.060003 NLP0013I 40 OPT 331845161.4247774 43 0.084005 NLP0013I 3 OPT 331845161.4248354 7 0.012001 NLP0013I 4 OPT 331845161.4248354 7 0.016001 Cbc0004I Integer solution of 3.31845e+08 found after 374 iterations and 11 nodes (2.79 seconds) NLP0012I Num Status Obj It time NLP0013I 41 INFEAS 321922307.6678742 30 0.076005 NLP0013I 42 OPT 331837498.1770155 42 0.120007 NLP0013I 5 OPT 331837498.1767626 12 0.020002 Cbc0004I Integer solution of 3.31837e+08 found after 446 iterations and 13 nodes (3.01 seconds) NLP0013I 43 OPT 376247685.1285241 19 0.040002 NLP0013I 44 OPT 401308736.2002533 19 0.040003 NLP0013I 45 OPT 768026093.4071289 20 0.040002 NLP0013I 46 OPT 298044921.842222 28 0.056003 NLP0013I 47 OPT 331846508.1067767 36 0.072005 NLP0013I 48 OPT 331860409.0927733 116 0.392024 NLP0013I 49 INFEAS 314698299.2873732 36 0.100006 NLP0013I 50 INFEAS 314718200.890434 31 0.076005 NLP0013I 51 OPT 331870226.4607807 24 0.048003 Cbc0001I Search completed - best objective 331837498.1767626, took 775 iterations and 22 nodes (3.88 seconds) Cbc0032I Strong branching done 12 times (678 iterations), fathomed 0 nodes and fixed 3 variables Cbc0035I Maximum depth 7, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = 331837498.176763. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT 331837498.1767626 12 0.024002 MINLP solution: 331837498.2 (22 nodes, 3.95 seconds) Best possible: 331837498.2 Absolute gap: 0 Relative gap: 0 GAMS/Bonmin finished. --- Restarting execution --- fac2.gms(192) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job fac2.gms Stop 09/02/08 16:23:06 elapsed 0:00:04.013