--- Job synthes3 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
--- synthes3.gms(108) 2 Mb
--- Starting execution: elapsed 0:00:00.002
--- synthes3.gms(103) 3 Mb
--- Generating MINLP model m
--- synthes3.gms(108) 5 Mb
---   24 rows  18 columns  91 non-zeroes
---   130 nl-code  12 nl-non-zeroes
---   8 discrete-columns
--- synthes3.gms(108) 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         15.08218453602923       16       0.024001
OA0003I New best feasible of 104.294 found after 0.032002 sec.
Cbc0012I Integer solution of 104.294 found by noonlinear programm after 3 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 15.0822 to 22.4929 in 2 passes
Cbc0014I Cut generator 0 (Mixed Integer Gomory) - 5 row cuts, 0 column cuts (3 active)
Cbc0014I Cut generator 1 (Probing) - 26 row cuts, 1 column cuts (0 active)
Cbc0014I Cut generator 2 (Mixed Integer Rounding) - 8 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) - 3 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.) - 6 row cuts, 0 column cuts (0 active)
Cbc0010I After 0 nodes, 1 on tree, 104.294 best solution, best possible 22.4929 (0.03 seconds)
OA0003I New best feasible of 85.514 found after 0.15601 sec.
Cbc0016I Integer solution of 85.514 found by strong branching after 42 iterations and 3 nodes (0.15 seconds)
OA0003I New best feasible of 77.1043 found after 0.248016 sec.
Cbc0016I Integer solution of 77.1043 found by strong branching after 54 iterations and 4 nodes (0.24 seconds)
OA0003I New best feasible of 76.4194 found after 0.368023 sec.
Cbc0016I Integer solution of 76.4194 found by strong branching after 77 iterations and 6 nodes (0.36 seconds)
OA0003I New best feasible of 68.0097 found after 0.432027 sec.
Cbc0016I Integer solution of 68.0097 found by strong branching after 89 iterations and 7 nodes (0.43 seconds)
Cbc0001I Search completed - best objective 68.00974051959115, took 131 iterations and 10 nodes (0.57 seconds)
Cbc0032I Strong branching done 50 times (78 iterations), fathomed 6 nodes and fixed 1 variables
Cbc0035I Maximum depth 2, 0 variables fixed on reduced cost
Mixed Integer Gomory was tried 12 times and created 36 cuts of which 17 were active after adding rounds of cuts
Probing was tried 12 times and created 39 cuts of which 0 were active after adding rounds of cuts
Mixed Integer Rounding was tried 12 times and created 60 cuts of which 0 were active after adding rounds of cuts
Flow Covers was tried 12 times and created 17 cuts of which 0 were active after adding rounds of cuts
Outer Approximation feasibility check. was tried 24 times and created 145 cuts of which 0 were active after adding rounds of cuts

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

MINLP solution:          68.00974052   (10 nodes, 0.59 seconds)
Best possible:           68.00974052
Absolute gap:             1.8539e-09
Relative gap:             2.7259e-11

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