--- Job synthes1 Start 09/06/08 16:06:50
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
--- synthes1.gms(65) 2 Mb
--- Starting execution: elapsed 0:00:00.002
--- synthes1.gms(60) 3 Mb
--- Generating MINLP model m
--- synthes1.gms(65) 5 Mb
---   7 rows  7 columns  23 non-zeroes
---   83 nl-code  6 nl-non-zeroes
---   3 discrete-columns
--- synthes1.gms(65) 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         0.7592843922105672      9        0.016001
OA0003I New best feasible of 7.09273 found after 0.032002 sec.
Cbc0012I Integer solution of 7.09273 found by noonlinear programm after 3 iterations and 0 nodes (0.04 seconds)
Cbc0031I 2 added rows had average density of 5
Cbc0013I At root node, 1 cuts changed objective from 0.759284 to 1.48883 in 3 passes
Cbc0014I Cut generator 0 (Mixed Integer Gomory) - 2 row cuts, 0 column cuts (1 active)
Cbc0014I Cut generator 1 (Probing) - 1 row cuts, 0 column cuts (0 active)
Cbc0014I Cut generator 2 (Mixed Integer Rounding) - 0 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) - 1 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)
OA0003I New best feasible of 6.00976 found after 0.060004 sec.
Cbc0016I Integer solution of 6.00976 found by strong branching after 3 iterations and 0 nodes (0.06 seconds)
Cbc0001I Search completed - best objective 6.009758908948257, took 3 iterations and 0 nodes (0.13 seconds)
Cbc0032I Strong branching done 4 times (7 iterations), fathomed 1 nodes and fixed 0 variables
Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost
Mixed Integer Gomory was tried 3 times and created 2 cuts of which 1 were active after adding rounds of cuts
Probing was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts
Flow Covers was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts
Outer Approximation feasibility check. was tried 4 times and created 20 cuts of which 0 were active after adding rounds of cuts

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

MINLP solution:          6.009758909   (0 nodes, 0.16 seconds)
Best possible:           6.009758909
Absolute gap:             3.5527e-15
Relative gap:             5.9116e-16

GAMS/Bonmin finished.
--- Restarting execution
--- synthes1.gms(65) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job synthes1.gms Stop 09/06/08 16:06:50 elapsed 0:00:00.533