--- Job meanvarx Start 09/04/08 06:04:12 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved *** License File has expired 3 days ago Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- meanvarx.gms(148) 2 Mb --- Starting execution: elapsed 0:00:00.002 --- meanvarx.gms(143) 3 Mb --- Generating MINLP model m --- meanvarx.gms(148) 5 Mb --- 45 rows 36 columns 111 non-zeroes --- 346 nl-code 7 nl-non-zeroes --- 14 discrete-columns --- meanvarx.gms(148) 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 bonmin.nlp_failure_behavior = fathom 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 14.30978542909657 23 0.032002 NLP0013I 2 OPT 14.45318700550116 25 0.040003 NLP0013I 3 OPT 14.30978542798874 27 0.044003 NLP0013I 4 OPT 14.40406225069944 27 0.040002 NLP0013I 5 OPT 14.36923211530623 31 0.048003 NLP0013I 6 OPT 14.59110451784323 27 0.040003 NLP0013I 7 OPT 14.30978542798875 26 0.040002 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 14.3098 (0.26 seconds) NLP0013I 8 OPT 14.30978542798875 26 0.040002 NLP0013I 9 OPT 14.36923211523362 35 0.060004 NLP0013I 10 OPT 14.76867377307813 28 0.048003 NLP0013I 11 OPT 14.36923211510553 23 0.036002 NLP0013I 12 OPT 14.36923211510553 23 0.036002 NLP0013I 13 OPT 14.36923211506552 22 0.036003 NLP0012I Num Status Obj It time NLP0013I 1 OPT 14.36923211492544 29 0.044002 Cbc0004I Integer solution of 14.3692 found after 106 iterations and 4 nodes (0.56 seconds) NLP0013I 14 OPT 14.40406225070315 27 0.040003 Cbc0011I Exiting as integer gap of 0.0594467 less than 0 or 1% Cbc0001I Search completed - best objective 14.36923211492544, took 133 iterations and 5 nodes (0.60 seconds) Cbc0032I Strong branching done 4 times (214 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 = 14.369232. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT 14.36923211492544 29 0.040003 MINLP solution: 14.36923211 (5 nodes, 0.68 seconds) Best possible: 14.36923211 Absolute gap: 1.7764e-15 Relative gap: 1.2362e-16 GAMS/Bonmin finished. --- Restarting execution --- meanvarx.gms(148) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job meanvarx.gms Stop 09/04/08 06:04:13 elapsed 0:00:00.717