--- Job gbd Start 09/05/08 09:04:36
GAMS Rev 228  Copyright (C) 1987-2008 GAMS Development. All rights reserved
*** License File has expired 4 days ago
Licensee: Stefan Vigerske                                G071106/0001CB-LNX
          Humboldt University Berlin, Numerical Mathematics          DC5918
--- Starting compilation
--- gbd.gms(56) 2 Mb
--- Starting execution: elapsed 0:00:00.001
--- gbd.gms(51) 3 Mb
--- Generating MINLP model m
--- gbd.gms(56) 5 Mb
---   5 rows  5 columns  17 non-zeroes
---   12 nl-code  1 nl-non-zeroes
---   3 discrete-columns
--- gbd.gms(56) 3 Mb
--- Executing BONMIN: elapsed 0:00:00.003

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.max_consecutive_infeasible = 3                     yes
             bonmin.nlp_failure_behavior = fathom                yes
       bonmin.num_resolve_at_infeasibles = 1                     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         2.20000000002           9        0.016001
NLP0013I     2        OPT         2.200000000011826       9        0.008001
NLP0013I     3        OPT         2.312500000037236       8        0.012
NLP0013I     4        OPT         2.312500000011463       10       0.012
NLP0013I     5        OPT         2.20000000002           7        0.012001
NLP0013I     6        INFEAS      2.555555555555251       16       0.036002
NLP0013I     7        OPT         2.20000000002           6        0.008001
NLP0013I     8        OPT         2.20000000002           6        0.012001
Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 2.2 (0.10 seconds)
NLP0013I     9        OPT         2.20000000000906        8        0.012
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         2.20000000001           5        0.008001
Cbc0004I Integer solution of 2.2 found after 14 iterations and 1 nodes (0.12 seconds)
Cbc0001I Search completed - best objective 2.20000000001, took 14 iterations and 1 nodes (0.12 seconds)
Cbc0032I Strong branching done 3 times (56 iterations), fathomed 0 nodes and fixed 1 variables
Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost

Bonmin finished. Found feasible point. Objective function = 2.200000.
Resolve with fixed discrete variables to get dual values.
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         2.20000000001           5        0.008

MINLP solution:                  2.2   (1 nodes, 0.15 seconds)
Best possible:                   2.2
Absolute gap:                      0
Relative gap:                      0

GAMS/Bonmin finished.
--- Restarting execution
--- gbd.gms(56) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job gbd.gms Stop 09/05/08 09:04:36 elapsed 0:00:00.179