--- Job nvs10 Start 09/05/08 17:38:27 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved *** License File has expired 4 days ago Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- nvs10.gms(55) 2 Mb --- Starting execution: elapsed 0:00:00.002 --- nvs10.gms(50) 3 Mb --- Generating MINLP model m --- nvs10.gms(55) 5 Mb --- 3 rows 3 columns 7 non-zeroes --- 93 nl-code 6 nl-non-zeroes --- 2 discrete-columns --- nvs10.gms(55) 3 Mb --- Executing BONMIN: elapsed 0:00:00.003 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 bonmin.max_consecutive_infeasible = 3 yes bonmin.nlp_failure_behavior = fathom yes bonmin.num_resolve_at_infeasibles = 1 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 -313.09 17 0.024002 NLP0013I 2 OPT -311.33999999999 6 0.008 NLP0013I 3 OPT -310.206580983216 7 0.008001 NLP0013I 4 OPT -310.1499999999901 6 0.008001 NLP0013I 5 OPT -311.623091246595 7 0.012 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible -313.09 (0.04 seconds) NLP0013I 6 OPT -311.33999999999 6 0.008001 NLP0013I 7 OPT -310.7999999999801 8 0.016001 NLP0012I Num Status Obj It time NLP0013I 1 OPT -310.8000000000001 0 0 Cbc0004I Integer solution of -310.8 found after 14 iterations and 2 nodes (0.07 seconds) NLP0013I 8 OPT -308.39999999998 7 0.008 Cbc0011I Exiting as integer gap of 2.29 less than 0 or 1% Cbc0001I Search completed - best objective -310.8000000000001, took 21 iterations and 3 nodes (0.08 seconds) Cbc0032I Strong branching done 2 times (26 iterations), fathomed 0 nodes and fixed 0 variables Cbc0035I Maximum depth 1, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = -310.800000. All variables are discrete. Dual variables for fixed problem will be not available. NLP0012I Num Status Obj It time NLP0013I 1 OPT -310.8000000000001 0 0 MINLP solution: -310.8 (3 nodes, 0.1 seconds) Best possible: -310.8 Absolute gap: 0 Relative gap: 0 GAMS/Bonmin finished. --- Restarting execution --- nvs10.gms(55) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job nvs10.gms Stop 09/05/08 17:38:27 elapsed 0:00:00.131