--- Job ex1223 Start 09/03/08 21:29:54
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
--- ex1223.gms(83) 2 Mb
--- Starting execution: elapsed 0:00:00.002
--- ex1223.gms(78) 3 Mb
--- Generating MINLP model m
--- ex1223.gms(83) 5 Mb
---   14 rows  12 columns  40 non-zeroes
---   116 nl-code  17 nl-non-zeroes
---   4 discrete-columns
--- ex1223.gms(83) 3 Mb
--- Executing BONMIN: elapsed 0:00:00.004

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
             bonmin.nlp_failure_behavior = fathom                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.885300456566096       14       0.024002
NLP0013I     2        OPT         4.381447767171364       12       0.016001
NLP0013I     3        OPT         4.355835789816808       12       0.016001
NLP0013I     4        OPT         4.245289890456956       15       0.024002
NLP0013I     5        OPT         4.865676905844999       15       0.024001
NLP0013I     6        OPT         5.853848104121427       14       0.020001
NLP0013I     7        OPT         3.986034200946518       11       0.016001
NLP0013I     8        OPT         4.519347255463639       15       0.020001
NLP0013I     9        OPT         3.886852846934304       11       0.016001
Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 3.8853 (0.16 seconds)
NLP0013I     10       OPT         3.986034200946518       11       0.016001
NLP0013I     11       OPT         4.438019473443608       14       0.016001
NLP0013I     12       OPT         4.579582402506708       12       0.016001
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         4.579582402486707       8        0.012001
Cbc0004I Integer solution of 4.57958 found after 37 iterations and 3 nodes (0.22 seconds)
NLP0013I     13       OPT         5.316353397797103       12       0.020001
NLP0013I     14       OPT         4.885676896106875       13       0.020001
NLP0013I     15       OPT         5.853848104121427       14       0.020002
Cbc0001I Search completed - best objective 4.579582402486707, took 76 iterations and 6 nodes (0.28 seconds)
Cbc0032I Strong branching done 4 times (105 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.579582402486707       8        0.012

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

GAMS/Bonmin finished.
--- Restarting execution
--- ex1223.gms(83) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job ex1223.gms Stop 09/03/08 21:29:54 elapsed 0:00:00.358