--- Job eg_disc_s Start 09/02/08 14:14:49 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 --- eg_disc_s.gms(10373) 4 Mb --- Starting execution: elapsed 0:00:00.155 --- eg_disc_s.gms(10368) 5 Mb --- Generating MINLP model m --- eg_disc_s.gms(10373) 8 Mb --- 28 rows 8 columns 220 non-zeroes --- 350,438 nl-code 196 nl-non-zeroes --- 4 discrete-columns --- eg_disc_s.gms(10373) 5 Mb --- Executing BONMIN: elapsed 0:00:00.338 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 5.58990155230762 14 0.464029 NLP0013I 2 OPT 5.805367258522822 24 0.828051 NLP0013I 3 OPT 5.657161538330122 24 0.828052 NLP0013I 4 OPT 5.706522975109721 24 0.808051 NLP0013I 5 OPT 5.805367258239952 26 0.892055 NLP0013I 6 OPT 5.617224076949655 8 0.284018 NLP0013I 7 OPT 5.591099560599363 14 0.48403 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 5.5899 (4.12 seconds) NLP0013I 8 OPT 5.706522975109721 24 0.768048 NLP0013I 9 OPT 5.758526520590317 18 0.584036 NLP0013I 10 OPT 5.772934361524954 19 0.616039 NLP0012I Num Status Obj It time NLP0013I 1 OPT 5.772934361495801 7 0.248015 Cbc0004I Integer solution of 5.77293 found after 61 iterations and 3 nodes (6.34 seconds) NLP0013I 11 OPT 5.760539616511059 17 0.552035 NLP0013I 2 OPT 5.760539616473509 6 0.216013 Cbc0004I Integer solution of 5.76054 found after 78 iterations and 4 nodes (7.11 seconds) NLP0013I 12 OPT 6.147685157043743 19 0.616039 NLP0013I 13 OPT 5.805367258239952 26 0.852053 Cbc0001I Search completed - best objective 5.760539616473509, took 123 iterations and 6 nodes (8.58 seconds) Cbc0032I Strong branching done 3 times (120 iterations), fathomed 0 nodes and fixed 0 variables Cbc0035I Maximum depth 2, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = 5.760540. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT 5.760539616473509 6 0.212013 MINLP solution: 5.760539616 (6 nodes, 9.26 seconds) Best possible: 5.760539616 Absolute gap: 0 Relative gap: 0 GAMS/Bonmin finished. --- Restarting execution --- eg_disc_s.gms(10373) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job eg_disc_s.gms Stop 09/02/08 14:14:59 elapsed 0:00:09.732