--- Job ex1224 Start 09/02/08 15:19:46 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved *** License File has expired 1 days ago Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- ex1224.gms(68) 2 Mb --- Starting execution: elapsed 0:00:00.004 --- ex1224.gms(63) 3 Mb --- Generating MINLP model m --- ex1224.gms(68) 5 Mb --- 8 rows 12 columns 31 non-zeroes --- 44 nl-code 6 nl-non-zeroes --- 8 discrete-columns --- ex1224.gms(68) 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 -0.9526971471319589 20 0.028002 NLP0013I 2 OPT -0.9202678149238209 12 0.016001 NLP0013I 3 OPT -0.9506855950109996 10 0.012 NLP0013I 4 OPT -0.942510562099108 10 0.016001 NLP0013I 5 OPT -0.9479160944277399 8 0.012001 NLP0013I 6 OPT -0.9499158770556126 8 0.012001 NLP0013I 7 OPT -0.9444198565610739 17 0.024001 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible -0.952697 (0.10 seconds) NLP0013I 8 OPT -0.9506855950109996 10 0.012 NLP0013I 9 OPT -0.9483399345127187 8 0.012 NLP0013I 10 OPT -0.9197553913912755 10 0.016001 NLP0013I 11 OPT -0.9483399345127187 8 0.012001 NLP0013I 12 OPT -0.9443233173210872 9 0.016001 NLP0013I 13 OPT -0.9297343559178439 11 0.016001 NLP0013I 14 OPT -0.9434704998994512 10 0.016001 NLP0013I 15 OPT -0.9434704998994512 10 0.016001 NLP0012I Num Status Obj It time NLP0013I 1 OPT -0.94347049999 6 0.008001 Cbc0004I Integer solution of -0.94347 found after 37 iterations and 4 nodes (0.23 seconds) NLP0013I 16 OPT -0.9297343559178439 11 0.020001 Cbc0011I Exiting as integer gap of 0.00922665 less than 0 or 1% Cbc0001I Search completed - best objective -0.94347049999, took 48 iterations and 5 nodes (0.25 seconds) Cbc0032I Strong branching done 5 times (104 iterations), fathomed 0 nodes and fixed 0 variables Cbc0035I Maximum depth 3, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = -0.943470. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT -0.94347049999 6 0.008 MINLP solution: -0.9434705 (5 nodes, 0.3 seconds) Best possible: -0.9434705 Absolute gap: 0 Relative gap: 0 GAMS/Bonmin finished. --- Restarting execution --- ex1224.gms(68) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ex1224.gms Stop 09/02/08 15:19:47 elapsed 0:00:00.323