--- Job nvs04 Start 09/03/08 01:43:32
GAMS Rev 228  Copyright (C) 1987-2008 GAMS Development. All rights reserved
*** License File has expired 2 days ago
Licensee: Stefan Vigerske                                G071106/0001CB-LNX
          Humboldt University Berlin, Numerical Mathematics          DC5918
--- Starting compilation
--- nvs04.gms(51) 2 Mb
--- Starting execution: elapsed 0:00:00.004
--- nvs04.gms(46) 3 Mb
--- Generating MINLP model m
--- nvs04.gms(51) 5 Mb
---   1 rows  3 columns  3 non-zeroes
---   29 nl-code  2 nl-non-zeroes
---   2 discrete-columns
--- nvs04.gms(51) 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-BB                  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         1.165272969147304e-06   62       0.108007
NLP0013I     2        OPT         0.08536051101672497     6        0.008
NLP0013I     3        OPT         0.05042618790360713     19       0.032002
NLP0013I     4        OPT         2.120000000012841       6        0.008
NLP0013I     5        OPT         0.36000000001           16       0.024002
Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 1.16527e-06 (0.08 seconds)
NLP0013I     6        OPT         0.36000000001           16       0.024001
NLP0013I     7        OPT         0.7200000000199918      12       0.016001
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         0.720000000000006       0        0
Cbc0004I Integer solution of 0.72 found after 28 iterations and 2 nodes (0.12 seconds)
NLP0013I     8        OPT         0.7578011467425024      12       0.020001
NLP0013I     9        OPT         2.120000000012841       6        0.008
Cbc0001I Search completed - best objective 0.720000000000006, took 46 iterations and 4 nodes (0.15 seconds)
Cbc0032I Strong branching done 2 times (47 iterations), fathomed 0 nodes and fixed 0 variables
Cbc0035I Maximum depth 1, 0 variables fixed on reduced cost

Bonmin finished. Found feasible point. Objective function = 0.720000.
All variables are discrete. Dual variables for fixed problem will be not available.
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         0.720000000000006       0        0

MINLP solution:                 0.72   (4 nodes, 0.26 seconds)
Best possible:                  0.72
Absolute gap:                      0
Relative gap:                      0

GAMS/Bonmin finished.
--- Restarting execution
--- nvs04.gms(51) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job nvs04.gms Stop 09/03/08 01:43:32 elapsed 0:00:00.287