--- Job st_e38 Start 09/03/08 09:32:19 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_e38.gms(58) 2 Mb --- Starting execution: elapsed 0:00:00.004 --- st_e38.gms(53) 3 Mb --- Generating MINLP model m --- st_e38.gms(58) 5 Mb --- 4 rows 5 columns 11 non-zeroes --- 88 nl-code 6 nl-non-zeroes --- 2 discrete-columns --- st_e38.gms(58) 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 7197.727148524411 18 0.028002 NLP0012I Num Status Obj It time NLP0013I 1 OPT 7197.727148524379 10 0.016001 Cbc0004I Integer solution of 7197.73 found after 0 iterations and 0 nodes (0.02 seconds) Cbc0001I Search completed - best objective 7197.727148524379, took 0 iterations and 0 nodes (0.02 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = 7197.727149. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT 7197.72714852438 10 0.016001 MINLP solution: 7197.727149 (0 nodes, 0.06 seconds) Best possible: 7197.727149 Absolute gap: 9.0949e-13 Relative gap: 1.2636e-16 GAMS/Bonmin finished. --- Restarting execution --- st_e38.gms(58) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job st_e38.gms Stop 09/03/08 09:32:19 elapsed 0:00:00.090