--- Job m3 Start 09/06/08 15:03:35
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
--- m3.gms(144) 2 Mb
--- Starting execution: elapsed 0:00:00.002
--- m3.gms(139) 3 Mb
--- Generating MINLP model m
--- m3.gms(144) 5 Mb
---   44 rows  27 columns  157 non-zeroes
---   43 nl-code  6 nl-non-zeroes
---   6 discrete-columns
--- m3.gms(144) 3 Mb
--- Executing BONMIN: elapsed 0:00:00.005

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         8.999689353682569e-11   22       0.036002
Cbc0031I 5 added rows had average density of 8.6
Cbc0013I At root node, 5 cuts changed objective from 0 to 0.0616504 in 20 passes
Cbc0014I Cut generator 0 (Mixed Integer Gomory) - 104 row cuts, 0 column cuts (5 active)
Cbc0014I Cut generator 1 (Probing) - 0 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) - 0 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.) - 0 row cuts, 0 column cuts (0 active)
Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0.0616504 (0.04 seconds)
OA0003I New best feasible of 37.8 found after 0.076005 sec.
Cbc0016I Integer solution of 37.8 found by strong branching after 368 iterations and 5 nodes (0.08 seconds)
Cbc0001I Search completed - best objective 37.80000000028564, took 497 iterations and 12 nodes (0.10 seconds)
Cbc0032I Strong branching done 66 times (532 iterations), fathomed 4 nodes and fixed 2 variables
Cbc0035I Maximum depth 4, 0 variables fixed on reduced cost
Mixed Integer Gomory was tried 30 times and created 127 cuts of which 20 were active after adding rounds of cuts
Outer Approximation feasibility check. was tried 1 times and created 8 cuts of which 0 were active after adding rounds of cuts

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

MINLP solution:                 37.8   (12 nodes, 0.13 seconds)
Best possible:                  37.8
Absolute gap:             4.3485e-12
Relative gap:             1.1504e-13

GAMS/Bonmin finished.
--- Restarting execution
--- m3.gms(144) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job m3.gms Stop 09/06/08 15:03:35 elapsed 0:00:00.201