--- Job st_e13 Start 09/03/08 09:31:29 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_e13.gms(54) 2 Mb --- Starting execution: elapsed 0:00:00.033 --- st_e13.gms(49) 3 Mb --- Generating MINLP model m --- st_e13.gms(54) 5 Mb --- 3 rows 3 columns 7 non-zeroes --- 9 nl-code 1 nl-non-zeroes --- 1 discrete-columns --- st_e13.gms(54) 3 Mb --- Executing BONMIN: elapsed 0:00:00.035 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.00000000002 13 0.020001 NLP0012I Num Status Obj It time NLP0013I 1 OPT 2.00000000001 5 0.008 Cbc0004I Integer solution of 2 found after 0 iterations and 0 nodes (0.01 seconds) Cbc0001I Search completed - best objective 2.00000000001, took 0 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = 2.000000. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT 2.00000000001 5 0.008001 MINLP solution: 2 (0 nodes, 0.04 seconds) Best possible: 2 Absolute gap: 0 Relative gap: 0 GAMS/Bonmin finished. --- Restarting execution --- st_e13.gms(54) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job st_e13.gms Stop 09/03/08 09:31:29 elapsed 0:00:00.096