--- Job nvs09 Start 09/03/08 01:43:35
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
--- nvs09.gms(73) 2 Mb
--- Starting execution: elapsed 0:00:00.004
--- nvs09.gms(68) 3 Mb
--- Generating MINLP model m
--- nvs09.gms(73) 5 Mb
---   1 rows  11 columns  11 non-zeroes
---   280 nl-code  10 nl-non-zeroes
---   10 discrete-columns
--- nvs09.gms(73) 3 Mb
--- Executing BONMIN: elapsed 0:00:00.006

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         -43.13433691793526      6        0.012001
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         -43.13433691803532      0        0
Cbc0004I Integer solution of -43.1343 found after 0 iterations and 0 nodes (0.00 seconds)
Cbc0001I Search completed - best objective -43.13433691803532, took 0 iterations and 0 nodes (0.00 seconds)
Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost

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

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

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