--- Job synthes2 Start 09/06/08 16:06:51
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
--- synthes2.gms(83) 2 Mb
--- Starting execution: elapsed 0:00:00.005
--- synthes2.gms(78) 3 Mb
--- Generating MINLP model m
--- synthes2.gms(83) 5 Mb
---   15 rows  12 columns  49 non-zeroes
---   81 nl-code  8 nl-non-zeroes
---   5 discrete-columns
--- synthes2.gms(83) 3 Mb
--- Executing BONMIN: elapsed 0:00:00.007

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         -0.5544169122836422     22       0.036002
OA0003I New best feasible of 74.2945 found after 0.032002 sec.
Cbc0012I Integer solution of 74.2945 found by noonlinear programm after 17 iterations and 0 nodes (0.03 seconds)
Cbc0031I 5 added rows had average density of 5.2
Cbc0013I At root node, 3 cuts changed objective from -0.554417 to 24.112 in 5 passes
Cbc0014I Cut generator 0 (Mixed Integer Gomory) - 9 row cuts, 0 column cuts (3 active)
Cbc0014I Cut generator 1 (Probing) - 31 row cuts, 1 column cuts (0 active)
Cbc0014I Cut generator 2 (Mixed Integer Rounding) - 6 row cuts, 0 column cuts (0 active)
Cbc0014I Cut generator 3 (Cover) - 0 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) - 5 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.) - 5 row cuts, 0 column cuts (0 active)
Cbc0010I After 0 nodes, 1 on tree, 74.2945 best solution, best possible 24.112 (0.03 seconds)
OA0003I New best feasible of 73.0353 found after 0.124008 sec.
Cbc0016I Integer solution of 73.0353 found by strong branching after 39 iterations and 2 nodes (0.12 seconds)
Cbc0001I Search completed - best objective 73.03531252510543, took 51 iterations and 4 nodes (0.15 seconds)
Cbc0032I Strong branching done 18 times (40 iterations), fathomed 2 nodes and fixed 1 variables
Cbc0035I Maximum depth 1, 0 variables fixed on reduced cost
Mixed Integer Gomory was tried 9 times and created 13 cuts of which 7 were active after adding rounds of cuts
Probing was tried 9 times and created 32 cuts of which 0 were active after adding rounds of cuts
Mixed Integer Rounding was tried 9 times and created 12 cuts of which 0 were active after adding rounds of cuts
Flow Covers was tried 9 times and created 7 cuts of which 0 were active after adding rounds of cuts
Outer Approximation feasibility check. was tried 6 times and created 31 cuts of which 0 were active after adding rounds of cuts

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

MINLP solution:          73.03531253   (4 nodes, 0.16 seconds)
Best possible:           73.03531253
Absolute gap:             5.6843e-14
Relative gap:              7.783e-16

GAMS/Bonmin finished.
--- Restarting execution
--- synthes2.gms(83) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job synthes2.gms Stop 09/06/08 16:06:51 elapsed 0:00:00.224