--- Job nvs10 Start 09/06/08 15:05: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
--- nvs10.gms(55) 2 Mb
--- Starting execution: elapsed 0:00:00.001
--- nvs10.gms(50) 3 Mb
--- Generating MINLP model m
--- nvs10.gms(55) 5 Mb
---   3 rows  3 columns  7 non-zeroes
---   93 nl-code  6 nl-non-zeroes
---   2 discrete-columns
--- nvs10.gms(55) 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-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         -313.09                 17       0.020001
Cbc0031I 1 added rows had average density of 2
Cbc0013I At root node, 1 cuts changed objective from -313.09 to -313.09 in 10 passes
Cbc0014I Cut generator 0 (Mixed Integer Gomory) - 12 row cuts, 0 column cuts (1 active)
Cbc0014I Cut generator 1 (Probing) - 0 row cuts, 1 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 -313.09 (0.00 seconds)
OA0003I New best feasible of 168 found after 0.008001 sec.
Cbc0016I Integer solution of 168 found by strong branching after 20 iterations and 2 nodes (0.01 seconds)
OA0003I New best feasible of -308.4 found after 0.008001 sec.
Cbc0012I Integer solution of -308.4 found by noonlinear programm after 24 iterations and 4 nodes (0.01 seconds)
OA0003I New best feasible of -310.8 found after 0.012001 sec.
Cbc0016I Integer solution of -310.8 found by strong branching after 29 iterations and 5 nodes (0.01 seconds)
Cbc0011I Exiting as integer gap of 2.29 less than 0 or 1%
Cbc0001I Search completed - best objective -310.8000000000001, took 31 iterations and 6 nodes (0.01 seconds)
Cbc0032I Strong branching done 14 times (11 iterations), fathomed 2 nodes and fixed 0 variables
Cbc0035I Maximum depth 1, 0 variables fixed on reduced cost
Mixed Integer Gomory was tried 16 times and created 16 cuts of which 3 were active after adding rounds of cuts
Outer Approximation feasibility check. was tried 9 times and created 30 cuts of which 0 were active after adding rounds of cuts

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

MINLP solution:               -310.8   (6 nodes, 0.02 seconds)
Best possible:                -310.8
Absolute gap:                      0
Relative gap:                      0

GAMS/Bonmin finished.
--- Restarting execution
--- nvs10.gms(55) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job nvs10.gms Stop 09/06/08 15:05:51 elapsed 0:00:00.068