--- Job st_e36 Start 09/03/08 09:32:19
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
--- st_e36.gms(56) 2 Mb
--- Starting execution: elapsed 0:00:00.003
--- st_e36.gms(51) 3 Mb
--- Generating MINLP model m
--- st_e36.gms(56) 5 Mb
---   3 rows  3 columns  7 non-zeroes
---   208 nl-code  6 nl-non-zeroes
---   1 discrete-columns
--- st_e36.gms(56) 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         -246.0245575245639      30       0.044003
NLP0013I     2        OPT         -166.4440002097364      94       0.180012
NLP0013I     3        OPT         -245.9999999999948      7        0.012
Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible -246.025 (0.20 seconds)
NLP0013I     4        OPT         -245.9999999999948      7        0.012001
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         -245.9999999997848      0        0
Cbc0004I Integer solution of -246 found after 7 iterations and 1 nodes (0.21 seconds)
NLP0013I     5        OPT         -166.4440002097364      94       0.180012
Cbc0011I Exiting as integer gap of 0.0245575 less than 0 or 1%
Cbc0001I Search completed - best objective -245.9999999997848, took 101 iterations and 2 nodes (0.39 seconds)
Cbc0032I Strong branching done 1 times (101 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 = -246.000000.
Resolve with fixed discrete variables to get dual values.
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         -245.9999999997848      0        0.004

MINLP solution:                 -246   (2 nodes, 0.45 seconds)
Best possible:                  -246
Absolute gap:                      0
Relative gap:                      0

GAMS/Bonmin finished.
--- Restarting execution
--- st_e36.gms(56) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job st_e36.gms Stop 09/03/08 09:32:19 elapsed 0:00:00.473