--- Job nvs01 Start 09/03/08 01:43:30 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 --- nvs01.gms(61) 2 Mb --- Starting execution: elapsed 0:00:00.030 --- nvs01.gms(56) 3 Mb --- Generating MINLP model m --- nvs01.gms(61) 5 Mb --- 4 rows 4 columns 10 non-zeroes --- 74 nl-code 7 nl-non-zeroes --- 2 discrete-columns --- nvs01.gms(61) 3 Mb --- Executing BONMIN: elapsed 0:00:00.031 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 12.04324783285325 13 0.020001 NLP0013I 2 INFEAS 14.55834576374637 22 0.048003 NLP0013I 3 OPT 12.37281867033343 6 0.008001 NLP0013I 4 OPT 12.37281867033343 6 0.008001 NLP0013I 5 OPT 12.45600000003 12 0.016001 NLP0013I 6 OPT 12.46966882158781 15 0.016001 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 12.3728 (0.10 seconds) NLP0013I 7 OPT 12.45600000003 12 0.020001 NLP0013I 8 OPT 13.29036645847493 18 0.028002 NLP0013I 9 OPT 13.46400000003 12 0.016001 NLP0013I 10 OPT 14.38759613563003 12 0.020001 NLP0013I 11 OPT 14.41989810001932 8 0.012001 NLP0012I Num Status Obj It time NLP0013I 1 OPT 14.4198981 1 0.004 Cbc0004I Integer solution of 14.4199 found after 68 iterations and 5 nodes (0.20 seconds) NLP0013I 12 OPT 14.85000000003 13 0.016001 NLP0013I 13 INFEAS 13.18929131759547 11 0.024002 NLP0013I 14 OPT 13.38715510489314 9 0.016001 NLP0013I 2 OPT 13.38715510487314 1 0.004 Cbc0004I Integer solution of 13.3872 found after 101 iterations and 8 nodes (0.27 seconds) NLP0013I 15 INFEAS 12.2717599107865 11 0.020001 NLP0013I 16 OPT 12.46966882158781 15 0.020001 NLP0013I 3 OPT 12.46966882156821 1 0 Cbc0004I Integer solution of 12.4697 found after 127 iterations and 10 nodes (0.32 seconds) Cbc0001I Search completed - best objective 12.46966882156821, took 127 iterations and 10 nodes (0.32 seconds) Cbc0032I Strong branching done 2 times (55 iterations), fathomed 0 nodes and fixed 1 variables Cbc0035I Maximum depth 4, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = 12.469669. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT 12.46966882156821 0 0 MINLP solution: 12.46966882 (10 nodes, 0.34 seconds) Best possible: 12.46966882 Absolute gap: 0 Relative gap: 0 GAMS/Bonmin finished. --- Restarting execution --- nvs01.gms(61) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job nvs01.gms Stop 09/03/08 01:43:30 elapsed 0:00:00.402