--- Job ex1223b Start 09/02/08 15:19:46
GAMS Rev 228  Copyright (C) 1987-2008 GAMS Development. All rights reserved
*** License File has expired 1 days ago
Licensee: Stefan Vigerske                                G071106/0001CB-LNX
          Humboldt University Berlin, Numerical Mathematics          DC5918
--- Starting compilation
--- ex1223b.gms(71) 2 Mb
--- Starting execution: elapsed 0:00:00.004
--- ex1223b.gms(66) 3 Mb
--- Generating MINLP model m
--- ex1223b.gms(71) 5 Mb
---   10 rows  8 columns  32 non-zeroes
---   116 nl-code  17 nl-non-zeroes
---   4 discrete-columns
--- ex1223b.gms(71) 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         3.885300456565798       14       0.020001
NLP0013I     2        OPT         4.381447767171345       9        0.012001
NLP0013I     3        OPT         4.355835788534393       10       0.012001
NLP0013I     4        OPT         4.24528989046517        9        0.012001
NLP0013I     5        OPT         4.86567689592253        12       0.020001
NLP0013I     6        OPT         5.853848102620093       8        0.012001
NLP0013I     7        OPT         3.98603420089113        12       0.020001
NLP0013I     8        OPT         4.519347255463242       8        0.012001
NLP0013I     9        OPT         3.886852820059441       13       0.020001
Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 3.8853 (0.13 seconds)
NLP0013I     10       OPT         3.98603420089113        12       0.020002
NLP0013I     11       OPT         4.438019473441367       8        0.012
NLP0013I     12       OPT         4.579582402498922       9        0.012
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         4.579582402486737       5        0.008001
Cbc0004I Integer solution of 4.57958 found after 29 iterations and 3 nodes (0.18 seconds)
NLP0013I     13       OPT         5.316353397793315       7        0.012001
NLP0013I     14       OPT         4.885676895937994       11       0.016001
NLP0013I     15       OPT         5.853848102620093       8        0.012
Cbc0001I Search completed - best objective 4.579582402486737, took 55 iterations and 6 nodes (0.22 seconds)
Cbc0032I Strong branching done 4 times (81 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 = 4.579582.
Resolve with fixed discrete variables to get dual values.
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         4.579582402486737       5        0.008

MINLP solution:          4.579582402   (6 nodes, 0.26 seconds)
Best possible:           4.579582402
Absolute gap:                      0
Relative gap:                      0

GAMS/Bonmin finished.
--- Restarting execution
--- ex1223b.gms(71) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job ex1223b.gms Stop 09/02/08 15:19:46 elapsed 0:00:00.287