--- Job nvs08 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
--- nvs08.gms(59) 2 Mb
--- Starting execution: elapsed 0:00:00.004
--- nvs08.gms(54) 3 Mb
--- Generating MINLP model m
--- nvs08.gms(59) 5 Mb
---   4 rows  4 columns  13 non-zeroes
---   67 nl-code  7 nl-non-zeroes
---   2 discrete-columns
--- nvs08.gms(59) 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         21.72254036154198       12       0.016001
NLP0013I     2        OPT         21.79176490250819       5        0.008001
NLP0013I     3        OPT         23.80814620151105       7        0.008
NLP0013I     4        OPT         21.72955927698575       5        0.008
NLP0013I     5        OPT         23.44972440373485       6        0.008001
Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 21.7225 (0.04 seconds)
NLP0013I     6        OPT         21.79176490250819       5        0.008
NLP0013I     7        OPT         26.00000000003018       8        0.016001
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         26.00000000001001       7        0.008001
Cbc0004I Integer solution of 26 found after 13 iterations and 2 nodes (0.07 seconds)
NLP0013I     8        OPT         23.44972734768174       15       0.020001
NLP0013I     2        OPT         23.44972734760909       5        0.008001
Cbc0004I Integer solution of 23.4497 found after 28 iterations and 3 nodes (0.10 seconds)
NLP0013I     9        OPT         23.80814620151105       7        0.012
Cbc0001I Search completed - best objective 23.44972734760909, took 35 iterations and 4 nodes (0.11 seconds)
Cbc0032I Strong branching done 2 times (23 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 = 23.449727.
Resolve with fixed discrete variables to get dual values.
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         23.44972734760909       5        0.008001

MINLP solution:          23.44972735   (4 nodes, 0.14 seconds)
Best possible:           23.44972735
Absolute gap:                      0
Relative gap:                      0

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