--- Job nvs07 Start 09/03/08 01:43:35 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 --- nvs07.gms(57) 2 Mb --- Starting execution: elapsed 0:00:00.003 --- nvs07.gms(52) 3 Mb --- Generating MINLP model m --- nvs07.gms(57) 5 Mb --- 3 rows 4 columns 9 non-zeroes --- 29 nl-code 3 nl-non-zeroes --- 3 discrete-columns --- nvs07.gms(57) 3 Mb --- Executing BONMIN: elapsed 0:00:00.005 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 3.333333335415302 18 0.028002 NLP0013I 2 OPT 3.999800319186644 11 0.016001 NLP0013I 3 OPT 4.000000001586726 10 0.016001 NLP0013I 4 OPT 3.333333333353333 6 0.008 NLP0013I 5 OPT 5.333333333363333 6 0.008 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 3.33333 (0.05 seconds) NLP0013I 6 OPT 3.999800319186644 11 0.016001 NLP0013I 7 INFEAS 3.261966226381379 8 0.020001 NLP0013I 8 INFEAS 8.000462955142162 8 0.020002 NLP0013I 9 OPT 4.000000001586726 10 0.016001 NLP0013I 10 OPT 4.00000000002 6 0.008 NLP0012I Num Status Obj It time NLP0013I 1 OPT 4 0 0 Cbc0004I Integer solution of 4 found after 27 iterations and 3 nodes (0.13 seconds) Cbc0001I Search completed - best objective 4, took 27 iterations and 3 nodes (0.13 seconds) Cbc0032I Strong branching done 3 times (49 iterations), fathomed 1 nodes and fixed 0 variables Cbc0035I Maximum depth 1, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = 4.000000. All variables are discrete. Dual variables for fixed problem will be not available. NLP0012I Num Status Obj It time NLP0013I 1 OPT 4 0 0 MINLP solution: 4 (3 nodes, 0.16 seconds) Best possible: 4 Absolute gap: 0 Relative gap: 0 GAMS/Bonmin finished. --- Restarting execution --- nvs07.gms(57) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job nvs07.gms Stop 09/03/08 01:43:35 elapsed 0:00:00.189