--- Job eg_int_s Start 09/02/08 14:15:10
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
--- eg_int_s.gms(9704) 4 Mb
--- Starting execution: elapsed 0:00:00.146
--- eg_int_s.gms(9699) 4 Mb
--- Generating MINLP model m
--- eg_int_s.gms(9704) 7 Mb
---   28 rows  8 columns  220 non-zeroes
---   328,710 nl-code  196 nl-non-zeroes
---   3 discrete-columns
--- eg_int_s.gms(9704) 4 Mb
--- Executing BONMIN: elapsed 0:00:00.313

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         5.589901552307702       17       0.544034
NLP0013I     2        OPT         7.17131773409224        25       0.752047
NLP0013I     3        OPT         7.821137666281285       20       0.612039
NLP0013I     4        OPT         5.808670177302758       21       0.636039
NLP0013I     5        OPT         7.969844117256038       19       0.592037
NLP0013I     6        OPT         5.632862818810357       22       0.660041
NLP0013I     7        OPT         10.48021858190557       17       0.516032
Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 5.5899 (3.78 seconds)
NLP0013I     8        OPT         7.17131773409224        25       0.764048
NLP0013I     9        OPT         8.026156248343991       21       0.688043
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         8.026156247426112       7        0.224014
Cbc0004I Integer solution of 8.02616 found after 46 iterations and 2 nodes (5.46 seconds)
NLP0013I     10       OPT         8.324941910867057       33       1.03207
NLP0013I     11       OPT         7.821137666281285       20       0.620039
NLP0013I     12       OPT         7.887243024188625       29       0.900056
NLP0013I     2        OPT         7.887243024242522       20       0.620039
Cbc0004I Integer solution of 7.88724 found after 128 iterations and 5 nodes (8.64 seconds)
NLP0013I     13       OPT         10.87701257877798       24       0.752047
Cbc0011I Exiting as integer gap of 0.0661054 less than 0 or 1%
Cbc0001I Search completed - best objective 7.887243024242522, took 152 iterations and 6 nodes (9.39 seconds)
Cbc0032I Strong branching done 3 times (124 iterations), fathomed 0 nodes and fixed 0 variables
Cbc0035I Maximum depth 1, 0 variables fixed on reduced cost

Bonmin finished. Found feasible point. Objective function = 7.887243.
Resolve with fixed discrete variables to get dual values.
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         7.887243024242526       20       0.612039

MINLP solution:          7.887243024   (6 nodes, 10.55 seconds)
Best possible:           7.887243024
Absolute gap:             4.4409e-15
Relative gap:             5.6305e-16

GAMS/Bonmin finished.
--- Restarting execution
--- eg_int_s.gms(9704) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job eg_int_s.gms Stop 09/02/08 14:15:21 elapsed 0:00:10.978