--- Job fac1 Start 09/06/08 14:43:31
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
--- fac1.gms(105) 2 Mb
--- Starting execution: elapsed 0:00:00.002
--- fac1.gms(100) 3 Mb
--- Generating MINLP model m
--- fac1.gms(105) 5 Mb
---   19 rows  23 columns  75 non-zeroes
---   173 nl-code  16 nl-non-zeroes
---   6 discrete-columns
--- fac1.gms(105) 3 Mb
--- Executing BONMIN: elapsed 0:00:00.004

GAMS/Bonmin MINLP Solver (Bonmin Library 0.99)
written by P. Bonami

List of user-set options:

                                    Name   Value                used
                        bonmin.algorithm = B-OA                  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         160733087.5843361       15       0.024002
OA0003I New best feasible of 5.4299e+08 found after 0.040002 sec.
Cbc0012I Integer solution of 5.4299e+08 found by noonlinear programm after 10 iterations and 0 nodes (0.04 seconds)
Cbc0031I 6 added rows had average density of 5.16667
Cbc0013I At root node, 6 cuts changed objective from 1.60733e+08 to 1.60735e+08 in 4 passes
Cbc0014I Cut generator 0 (Mixed Integer Gomory) - 14 row cuts, 0 column cuts (4 active)
Cbc0014I Cut generator 1 (Probing) - 26 row cuts, 0 column cuts (0 active)
Cbc0014I Cut generator 2 (Mixed Integer Rounding) - 4 row cuts, 0 column cuts (0 active)
Cbc0014I Cut generator 3 (Cover) - 7 row cuts, 0 column cuts (0 active)
Cbc0014I Cut generator 4 (Clique) - 0 row cuts, 0 column cuts (0 active)
Cbc0014I Cut generator 5 (Flow Covers) - 0 row cuts, 0 column cuts (0 active)
Cbc0014I Cut generator 6 (Outer Approximation decomposition.) - 0 row cuts, 0 column cuts (0 active)
Cbc0014I Cut generator 7 (Outer Approximation feasibility check.) - 4 row cuts, 0 column cuts (0 active)
OA0003I New best feasible of 3.87854e+08 found after 0.064004 sec.
Cbc0016I Integer solution of 3.87854e+08 found by strong branching after 10 iterations and 0 nodes (0.06 seconds)
OA0003I New best feasible of 1.60913e+08 found after 0.092005 sec.
Cbc0016I Integer solution of 1.60913e+08 found by strong branching after 10 iterations and 0 nodes (0.09 seconds)
Cbc0001I Search completed - best objective 160912612.3501701, took 10 iterations and 0 nodes (0.09 seconds)
Cbc0032I Strong branching done 6 times (14 iterations), fathomed 1 nodes and fixed 0 variables
Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost
Mixed Integer Gomory was tried 4 times and created 14 cuts of which 4 were active after adding rounds of cuts
Probing was tried 4 times and created 26 cuts of which 0 were active after adding rounds of cuts
Mixed Integer Rounding was tried 4 times and created 4 cuts of which 0 were active after adding rounds of cuts
Cover was tried 4 times and created 7 cuts of which 0 were active after adding rounds of cuts
Outer Approximation feasibility check. was tried 3 times and created 10 cuts of which 0 were active after adding rounds of cuts

Bonmin finished. Found feasible point. Objective function = 160912612.350170.
Resolve with fixed discrete variables to get dual values.

MINLP solution:          160912612.4   (0 nodes, 0.12 seconds)
Best possible:           160912612.4
Absolute gap:              1.651e-05
Relative gap:             1.0261e-13

GAMS/Bonmin finished.
--- Restarting execution
--- fac1.gms(105) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job fac1.gms Stop 09/06/08 14:43:31 elapsed 0:00:00.173