--- Job gbd Start 09/06/08 10:38:03
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
--- gbd.gms(56) 2 Mb
--- Starting execution: elapsed 0:00:00.002
--- gbd.gms(51) 3 Mb
--- Generating MINLP model m
--- gbd.gms(56) 5 Mb
---   5 rows  5 columns  17 non-zeroes
---   12 nl-code  1 nl-non-zeroes
---   3 discrete-columns
--- gbd.gms(56) 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-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         2.20000000002           9        0.016001
OA0003I New best feasible of 2.2 found after 0.004 sec.
Cbc0012I Integer solution of 2.2 found by noonlinear programm after 0 iterations and 0 nodes (0.00 seconds)
Cbc0013I At root node, 0 cuts changed objective from 2.2 to 2.2 in 1 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) - 0 row cuts, 0 column cuts (0 active)
Cbc0014I Cut generator 2 (Probing) - 0 row cuts, 1 column cuts (0 active)
Cbc0014I Cut generator 3 (Mixed Integer Rounding) - 0 row cuts, 0 column cuts (0 active)
Cbc0014I Cut generator 4 (Cover) - 0 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.) - 3 row cuts, 0 column cuts (0 active)
Cbc0001I Search completed - best objective 2.200000001183629, took 0 iterations and 0 nodes (0.00 seconds)
Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost
Outer Approximation feasibility check. was tried 1 times and created 3 cuts of which 0 were active after adding rounds of cuts

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

MINLP solution:          2.200000001   (0 nodes, 0.01 seconds)
Best possible:           2.200000001
Absolute gap:                      0
Relative gap:                      0

GAMS/Bonmin finished.
--- Restarting execution
--- gbd.gms(56) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job gbd.gms Stop 09/06/08 10:38:03 elapsed 0:00:00.054