--- Job fac3 Start 09/06/08 10:20:47 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved *** License File has expired 5 days ago Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- fac3.gms(191) 2 Mb --- Starting execution: elapsed 0:00:00.003 --- fac3.gms(186) 3 Mb --- Generating MINLP model m --- fac3.gms(191) 5 Mb --- 34 rows 67 columns 217 non-zeroes --- 555 nl-code 54 nl-non-zeroes --- 12 discrete-columns --- fac3.gms(191) 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-Hyb 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 22329872.36023375 24 0.048003 OA0003I New best feasible of 1.30654e+08 found after 0.036003 sec. Cbc0012I Integer solution of 1.30654e+08 found by noonlinear programm after 19 iterations and 0 nodes (0.04 seconds) Cbc0031I 7 added rows had average density of 11.8571 Cbc0013I At root node, 5 cuts changed objective from 2.23299e+07 to 2.41845e+07 in 3 passes Cbc0014I Cut generator 0 (NLP solution based oa cuts) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 1 (Mixed Integer Gomory) - 2 row cuts, 0 column cuts (2 active) Cbc0014I Cut generator 2 (Probing) - 25 row cuts, 0 column cuts (3 active) Cbc0014I Cut generator 3 (Mixed Integer Rounding) - 3 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 4 (Cover) - 4 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 5 (Clique) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 6 (Flow Covers) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 7 (Outer Approximation decomposition.) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 8 (Outer Approximation feasibility check.) - 2 row cuts, 0 column cuts (0 active) OA0003I New best feasible of 1.04952e+08 found after 0.080005 sec. Cbc0016I Integer solution of 1.04952e+08 found by strong branching after 19 iterations and 0 nodes (0.08 seconds) Cbc0010I After 0 nodes, 1 on tree, 1.04952e+08 best solution, best possible 2.41845e+07 (0.08 seconds) OA0003I New best feasible of 3.83101e+07 found after 0.164011 sec. Cbc0016I Integer solution of 3.83101e+07 found by strong branching after 50 iterations and 1 nodes (0.16 seconds) OA0003I New best feasible of 3.19951e+07 found after 0.220014 sec. Cbc0016I Integer solution of 3.19951e+07 found by strong branching after 50 iterations and 1 nodes (0.22 seconds) OA0003I New best feasible of 3.19823e+07 found after 0.260017 sec. Cbc0016I Integer solution of 3.19823e+07 found by strong branching after 58 iterations and 1 nodes (0.26 seconds) Cbc0001I Search completed - best objective 31982309.84800003, took 170 iterations and 6 nodes (0.49 seconds) Cbc0032I Strong branching done 58 times (201 iterations), fathomed 3 nodes and fixed 7 variables Cbc0035I Maximum depth 2, 0 variables fixed on reduced cost Mixed Integer Gomory was tried 9 times and created 9 cuts of which 5 were active after adding rounds of cuts Probing was tried 9 times and created 35 cuts of which 5 were active after adding rounds of cuts Mixed Integer Rounding was tried 9 times and created 6 cuts of which 0 were active after adding rounds of cuts Cover was tried 9 times and created 6 cuts of which 0 were active after adding rounds of cuts Outer Approximation feasibility check. was tried 11 times and created 27 cuts of which 0 were active after adding rounds of cuts implication was tried 6 times and created 12 cuts of which 0 were active after adding rounds of cuts Bonmin finished. Found feasible point. Objective function = 31982309.848000. Resolve with fixed discrete variables to get dual values. MINLP solution: 31982309.85 (6 nodes, 0.51 seconds) Best possible: 31982309.85 Absolute gap: 4.8056e-07 Relative gap: 1.5026e-14 GAMS/Bonmin finished. --- Restarting execution --- fac3.gms(191) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job fac3.gms Stop 09/06/08 10:20:48 elapsed 0:00:00.738