--- Job st_e32 Start 09/03/08 09:32:11 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 --- st_e32.gms(142) 2 Mb --- Starting execution: elapsed 0:00:00.003 --- st_e32.gms(137) 3 Mb --- Generating MINLP model m --- st_e32.gms(142) 5 Mb --- 19 rows 36 columns 169 non-zeroes --- 628 nl-code 63 nl-non-zeroes --- 18 discrete-columns --- st_e32.gms(142) 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 -2.029373816873604 92 0.272017 NLP0013I 2 OPT -1.842917343128637 16 0.028002 NLP0013I 3 INFEAS -2.238722959157423 42 0.108007 NLP0013I 4 OPT -1.842917343128637 16 0.028002 NLP0013I 5 OPT -1.734437139408106 15 0.024001 NLP0013I 6 OPT -1.41295095461489 15 0.024002 NLP0013I 7 OPT -1.804351406284505 13 0.020001 NLP0013I 8 INFEAS -1.989407981427135 53 0.128008 NLP0013I 9 OPT -1.804351406284505 13 0.024001 NLP0013I 10 OPT -1.60264420587472 13 0.020001 NLP0013I 11 INFEAS -1.855625150655335 24 0.056003 NLP0013I 12 OPT -1.60264420587472 13 0.020001 NLP0013I 13 OPT -1.432348504808376 14 0.024001 NLP0013I 14 INFEAS -1.606039284906412 22 0.052003 NLP0013I 15 OPT -1.432348504808376 14 0.024002 NLP0013I 16 OPT -1.431758628598812 15 0.024002 NLP0013I 17 INFEAS -1.472035793879065 50 0.124007 NLP0013I 18 OPT -1.431758628598812 15 0.028002 NLP0013I 19 OPT -1.431341717691565 15 0.024002 NLP0013I 20 OPT -1.420559518124153 14 0.024001 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible -1.43176 (0.83 seconds) NLP0012I Num Status Obj It time NLP0013I 21 OPT -1.430407283186997 14 0.024002 NLP0012I Num Status Obj It time NLP0013I 1 OPT -1.430407283328427 6 0.008 Cbc0004I Integer solution of -1.43041 found after 85 iterations and 1 nodes (0.86 seconds) NLP0013I 22 OPT -1.282423368352011 13 0.020001 Cbc0011I Exiting as integer gap of 0.00135135 less than 0 or 1% Cbc0001I Search completed - best objective -1.430407283328427, took 98 iterations and 2 nodes (0.89 seconds) Cbc0032I Strong branching done 7 times (321 iterations), fathomed 0 nodes and fixed 5 variables Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = -1.430407. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT -1.430407283328427 6 0.012001 MINLP solution: -1.430407283 (2 nodes, 1.18 seconds) Best possible: -1.430407283 Absolute gap: 2.2204e-16 Relative gap: 1.5523e-16 GAMS/Bonmin finished. --- Restarting execution --- st_e32.gms(142) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job st_e32.gms Stop 09/03/08 09:32:12 elapsed 0:00:01.216