--- Job nvs05 Start 09/03/08 01:43:33
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
--- nvs05.gms(77) 2 Mb
--- Starting execution: elapsed 0:00:00.003
--- nvs05.gms(72) 3 Mb
--- Generating MINLP model m
--- nvs05.gms(77) 5 Mb
---   10 rows  9 columns  31 non-zeroes
---   271 nl-code  24 nl-non-zeroes
---   2 discrete-columns
--- nvs05.gms(77) 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         5.211364075285944       475      1.10407
NLP0013I     2        OPT         5.361660591103314       19       0.024002
NLP0013I     3        OPT         5.470934108250082       89       0.16001
Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 5.21136 (0.19 seconds)
NLP0013I     4        OPT         5.361660591103314       19       0.028001
NLP0013I     5        INFEAS      5.214510909636885       12       0.028002
NLP0013I     6        OPT         7.621203682333448       10       0.016001
NLP0013I     7        OPT         7.621203682333448       10       0.016001
NLP0013I     8        OPT         7.754215744825395       16       0.024002
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         7.754215744864016       7        0.012001
Cbc0004I Integer solution of 7.75422 found after 45 iterations and 2 nodes (0.32 seconds)
NLP0013I     9        OPT         11.30346211036287       13       0.020001
NLP0013I     10       OPT         5.470934108250082       89       0.15201
NLP0013I     2        OPT         5.470934108234749       45       0.080005
Cbc0004I Integer solution of 5.47093 found after 147 iterations and 4 nodes (0.58 seconds)
Cbc0001I Search completed - best objective 5.470934108234749, took 147 iterations and 4 nodes (0.58 seconds)
Cbc0032I Strong branching done 2 times (130 iterations), fathomed 0 nodes and fixed 1 variables
Cbc0035I Maximum depth 1, 0 variables fixed on reduced cost

Bonmin finished. Found feasible point. Objective function = 5.470934.
Resolve with fixed discrete variables to get dual values.
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         5.470934108234747       45       0.080005

MINLP solution:          5.470934108   (4 nodes, 1.76 seconds)
Best possible:           5.470934108
Absolute gap:             1.7764e-15
Relative gap:             3.2469e-16

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