--- Job oaer Start 09/03/08 02:45:05
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
--- oaer.gms(64) 2 Mb
--- Starting execution: elapsed 0:00:00.009
--- oaer.gms(59) 3 Mb
--- Generating MINLP model m
--- oaer.gms(64) 5 Mb
---   8 rows  10 columns  26 non-zeroes
---   22 nl-code  2 nl-non-zeroes
---   3 discrete-columns
--- oaer.gms(64) 3 Mb
--- Executing BONMIN: elapsed 0:00:00.011

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         -2.631806297536969      12       0.016001
NLP0013I     2        OPT         -1.757281303842416      18       0.024001
NLP0013I     3        OPT         -1.923098500186781      18       0.024002
NLP0013I     4        OPT         -1.923098530285212      17       0.024001
NLP0013I     5        OPT         -1.720971654889705      12       0.016001
Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible -2.63181 (0.09 seconds)
NLP0013I     6        OPT         -1.923098530285212      17       0.020002
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         -1.923098502797773      23       0.024001
Cbc0004I Integer solution of -1.9231 found after 17 iterations and 1 nodes (0.14 seconds)
NLP0013I     7        OPT         -1.720971654889705      12       0.016001
Cbc0001I Search completed - best objective -1.923098502797773, took 29 iterations and 2 nodes (0.16 seconds)
Cbc0032I Strong branching done 2 times (65 iterations), fathomed 0 nodes and fixed 0 variables
Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost

Bonmin finished. Found feasible point. Objective function = -1.923099.
Resolve with fixed discrete variables to get dual values.
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         -1.923098502797784      23       0.028001

MINLP solution:         -1.923098503   (2 nodes, 0.22 seconds)
Best possible:          -1.923098503
Absolute gap:             1.1546e-14
Relative gap:              6.004e-15

GAMS/Bonmin finished.
--- Restarting execution
--- oaer.gms(64) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job oaer.gms Stop 09/03/08 02:45:05 elapsed 0:00:00.248