--- Job nvs06 Start 09/03/08 01:43:34
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
--- nvs06.gms(50) 2 Mb
--- Starting execution: elapsed 0:00:00.035
--- nvs06.gms(45) 3 Mb
--- Generating MINLP model m
--- nvs06.gms(50) 5 Mb
---   1 rows  3 columns  3 non-zeroes
---   66 nl-code  2 nl-non-zeroes
---   2 discrete-columns
--- nvs06.gms(50) 3 Mb
--- Executing BONMIN: elapsed 0:00:00.037

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.744152005587739       15       0.020001
NLP0013I     2        OPT         2.294222286443373       5        0.008001
NLP0013I     3        OPT         1.769855239624187       5        0.004
NLP0013I     4        OPT         1.74431587183416        5        0.004001
NLP0013I     5        OPT         1.847733384775369       5        0.004
Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 1.74415 (0.03 seconds)
NLP0013I     6        OPT         1.769855239624187       5        0.004001
NLP0013I     7        OPT         2.127769006324134       11       0.012001
NLP0013I     8        OPT         2.25679012346679        5        0.008
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         2.25679012345679        0        0
Cbc0004I Integer solution of 2.25679 found after 21 iterations and 3 nodes (0.06 seconds)
NLP0013I     9        OPT         2.3                     0        0
NLP0013I     10       OPT         1.770312501214965       5        0.008001
NLP0013I     2        OPT         1.7703125               0        0
Cbc0004I Integer solution of 1.77031 found after 26 iterations and 5 nodes (0.07 seconds)
NLP0013I     11       OPT         2.294222286443373       5        0.004
Cbc0001I Search completed - best objective 1.7703125, took 31 iterations and 6 nodes (0.08 seconds)
Cbc0032I Strong branching done 2 times (20 iterations), fathomed 0 nodes and fixed 0 variables
Cbc0035I Maximum depth 2, 0 variables fixed on reduced cost

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

MINLP solution:            1.7703125   (6 nodes, 0.1 seconds)
Best possible:             1.7703125
Absolute gap:                      0
Relative gap:                      0

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