--- Job eg_disc2_s Start 09/02/08 14:14:59
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_disc2_s.gms(10262) 4 Mb
--- Starting execution: elapsed 0:00:00.188
--- eg_disc2_s.gms(10257) 5 Mb
--- Generating MINLP model m
--- eg_disc2_s.gms(10262) 8 Mb
---   28 rows  8 columns  220 non-zeroes
---   345,006 nl-code  196 nl-non-zeroes
---   3 discrete-columns
--- eg_disc2_s.gms(10262) 5 Mb
--- Executing BONMIN: elapsed 0:00:00.367

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.589901552307704       25       0.812051
NLP0013I     2        OPT         5.63286281881575        18       0.592037
NLP0013I     3        OPT         5.612083998068317       10       0.340021
NLP0013I     4        OPT         5.62416744772415        27       0.932058
NLP0013I     5        OPT         5.610393954566397       28       0.924057
NLP0013I     6        OPT         5.619018597748481       28       0.932058
NLP0013I     7        OPT         5.595932376899482       26       0.872054
Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 5.5899 (4.60 seconds)
NLP0013I     8        OPT         5.612083998068317       10       0.332021
NLP0013I     9        OPT         5.630283384341984       21       0.684043
NLP0013I     10       OPT         5.679056366522778       9        0.32402
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         5.679056366485978       16       0.520033
Cbc0004I Integer solution of 5.67906 found after 40 iterations and 3 nodes (6.46 seconds)
NLP0013I     11       OPT         5.642100580053236       23       0.740046
NLP0013I     2        OPT         5.642100580010025       28       0.908057
Cbc0004I Integer solution of 5.6421 found after 63 iterations and 4 nodes (8.12 seconds)
NLP0013I     12       OPT         5.648650234908963       27       0.880055
Cbc0011I Exiting as integer gap of 0.052199 less than 0 or 1%
Cbc0001I Search completed - best objective 5.642100580010025, took 90 iterations and 5 nodes (9.00 seconds)
Cbc0032I Strong branching done 3 times (137 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 = 5.642101.
Resolve with fixed discrete variables to get dual values.
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         5.642100580010027       28       0.904057

MINLP solution:           5.64210058   (5 nodes, 10.72 seconds)
Best possible:            5.64210058
Absolute gap:             1.7764e-15
Relative gap:             3.1484e-16

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