--- Job st_testph4 Start 09/06/08 11:41:15
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
--- st_testph4.gms(71) 2 Mb
--- Starting execution: elapsed 0:00:00.001
--- st_testph4.gms(66) 3 Mb
--- Generating MINLP model m
--- st_testph4.gms(71) 5 Mb
---   11 rows  4 columns  28 non-zeroes
---   51 nl-code  3 nl-non-zeroes
---   3 discrete-columns
--- st_testph4.gms(71) 3 Mb
--- Executing BONMIN: elapsed 0:00:00.003

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         -82.96153846151765      11       0.016001
OA0003I New best feasible of -80.5 found after 0.004 sec.
Cbc0012I Integer solution of -80.5 found by noonlinear programm after 2 iterations and 0 nodes (0.00 seconds)
Cbc0031I 2 added rows had average density of 3.5
Cbc0013I At root node, 1 cuts changed objective from -82.9615 to -80.5 in 2 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) - 1 row cuts, 0 column cuts (1 active)
Cbc0014I Cut generator 2 (Probing) - 1 row cuts, 1 column cuts (0 active)
Cbc0014I Cut generator 3 (Mixed Integer Rounding) - 1 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.) - 1 row cuts, 0 column cuts (0 active)
Cbc0001I Search completed - best objective -80.5, took 2 iterations and 0 nodes (0.00 seconds)
Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost
Mixed Integer Gomory was tried 2 times and created 1 cuts of which 1 were active after adding rounds of cuts
Probing was tried 2 times and created 2 cuts of which 0 were active after adding rounds of cuts
Mixed Integer Rounding was tried 2 times and created 1 cuts of which 0 were active after adding rounds of cuts
Outer Approximation feasibility check. was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts

Bonmin finished. Found feasible point. Objective function = -80.500000.
All variables are discrete. Dual variables for fixed problem will be not available.

MINLP solution:                -80.5   (0 nodes, 0 seconds)
Best possible:                 -80.5
Absolute gap:                      0
Relative gap:                      0

GAMS/Bonmin finished.
--- Restarting execution
--- st_testph4.gms(71) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job st_testph4.gms Stop 09/06/08 11:41:15 elapsed 0:00:00.048