--- Job fac1 Start 09/03/08 22:33:32 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 --- fac1.gms(105) 2 Mb --- Starting execution: elapsed 0:00:00.002 --- fac1.gms(100) 3 Mb --- Generating MINLP model m --- fac1.gms(105) 5 Mb --- 19 rows 23 columns 75 non-zeroes --- 173 nl-code 16 nl-non-zeroes --- 6 discrete-columns --- fac1.gms(105) 3 Mb --- Executing BONMIN: elapsed 0:00:00.004 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 bonmin.nlp_failure_behavior = fathom 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 160733087.5843361 15 0.024002 NLP0013I 2 OPT 542987628.1662729 37 0.072004 NLP0013I 3 OPT 160734834.1194227 14 0.024002 NLP0013I 4 OPT 387852465.1912 57 0.108007 NLP0013I 5 OPT 160735389.7960856 15 0.024001 NLP0013I 6 OPT 160734335.7274976 23 0.044003 NLP0013I 7 OPT 160908563.4751696 17 0.028002 NLP0013I 8 OPT 160908563.4751696 24 0.044002 NLP0013I 9 OPT 160734335.7274977 21 0.036003 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 1.60733e+08 (0.38 seconds) NLP0013I 10 OPT 160734834.1194227 14 0.024001 NLP0013I 11 OPT 160737136.3312542 15 0.024002 NLP0013I 12 OPT 160738384.474412 18 0.032002 NLP0013I 13 INFEAS 302152982.7248267 22 0.052003 NLP0013I 14 OPT 172953719.4068785 20 0.028002 NLP0013I 15 OPT 172953719.4068785 20 0.028002 NLP0012I Num Status Obj It time NLP0013I 1 OPT 172953719.4068844 6 0.008001 Cbc0004I Integer solution of 1.72954e+08 found after 67 iterations and 3 nodes (0.59 seconds) NLP0013I 16 OPT 160912612.3501717 6 0.012 NLP0013I 2 OPT 160912612.3501762 6 0.012001 Cbc0004I Integer solution of 1.60913e+08 found after 73 iterations and 4 nodes (0.62 seconds) NLP0013I 17 OPT 387854009.1913202 35 0.056004 Cbc0011I Exiting as integer gap of 179525 less than 0 or 1% Cbc0001I Search completed - best objective 160912612.3501762, took 108 iterations and 5 nodes (0.67 seconds) Cbc0032I Strong branching done 5 times (250 iterations), fathomed 0 nodes and fixed 1 variables Cbc0035I Maximum depth 2, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = 160912612.350176. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT 160912612.3501762 6 0.012 MINLP solution: 160912612.4 (5 nodes, 0.71 seconds) Best possible: 160912612.4 Absolute gap: 0 Relative gap: 0 GAMS/Bonmin finished. --- Restarting execution --- fac1.gms(105) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job fac1.gms Stop 09/03/08 22:33:33 elapsed 0:00:00.739