--- Job batchdes Start 09/02/08 11:36:07 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 --- batchdes.gms(106) 2 Mb --- Starting execution: elapsed 0:00:00.036 --- batchdes.gms(101) 3 Mb --- Generating MINLP model m --- batchdes.gms(106) 5 Mb --- 20 rows 20 columns 53 non-zeroes --- 80 nl-code 10 nl-non-zeroes --- 9 discrete-columns --- batchdes.gms(106) 3 Mb --- Executing BONMIN: elapsed 0:00:00.038 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 160860.7520845937 73 0.15601 NLP0013I 2 OPT 161313.9386511879 11 0.016001 NLP0013I 3 OPT 174075.5532015848 21 0.036003 NLP0013I 4 OPT 165928.4023141506 13 0.020001 NLP0013I 5 INFEAS 208735.6483671101 29 0.064004 NLP0013I 6 OPT 165928.4023141506 13 0.020001 NLP0013I 7 OPT 165928.4023141486 13 0.020002 NLP0013I 8 INFEAS 177710.6631550779 32 0.072004 NLP0013I 9 OPT 165928.4023141486 13 0.024002 NLP0013I 10 OPT 174075.5532015846 13 0.020001 NLP0013I 11 OPT 167427.6571147027 14 0.020001 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 165928 (0.32 seconds) NLP0013I 12 OPT 167427.6571147027 14 0.020002 NLP0012I Num Status Obj It time NLP0013I 1 OPT 167427.6571147024 10 0.020001 Cbc0004I Integer solution of 167428 found after 40 iterations and 1 nodes (0.36 seconds) NLP0013I 13 OPT 174075.5532015854 12 0.016001 Cbc0011I Exiting as integer gap of 1499.25 less than 0 or 1% Cbc0001I Search completed - best objective 167427.6571147024, took 52 iterations and 2 nodes (0.38 seconds) Cbc0032I Strong branching done 4 times (146 iterations), fathomed 0 nodes and fixed 2 variables Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = 167427.657115. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT 167427.6571147023 10 0.016001 MINLP solution: 167427.6571 (2 nodes, 0.55 seconds) Best possible: 167427.6571 Absolute gap: 2.9104e-11 Relative gap: 1.7383e-16 GAMS/Bonmin finished. --- Restarting execution --- batchdes.gms(106) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job batchdes.gms Stop 09/02/08 11:36:08 elapsed 0:00:00.671