--- Job fuel Start 09/02/08 16:24:55
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
--- fuel.gms(89) 2 Mb
--- Starting execution: elapsed 0:00:00.004
--- fuel.gms(84) 3 Mb
--- Generating MINLP model m
--- fuel.gms(89) 5 Mb
---   16 rows  16 columns  39 non-zeroes
---   87 nl-code  6 nl-non-zeroes
---   3 discrete-columns
--- fuel.gms(89) 3 Mb
--- Executing BONMIN: elapsed 0:00:00.006

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         8457.68778900613        14       0.024002
NLP0013I     2        OPT         9306.58180020771        24       0.040002
NLP0013I     3        OPT         8503.126899305029       7        0.012001
NLP0013I     4        OPT         9840.345745398325       28       0.048003
NLP0013I     5        OPT         8491.286940600507       6        0.008001
NLP0013I     6        INFEAS      8903.547373012294       20       0.048003
NLP0013I     7        OPT         8483.394080845235       6        0.008001
NLP0013I     8        OPT         8483.394080845235       6        0.012
Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 8483.39 (0.18 seconds)
NLP0013I     9        OPT         8518.177878657243       7        0.012001
NLP0013I     10       OPT         8566.118961684613       6        0.008001
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         8566.118961687705       6        0.008
Cbc0004I Integer solution of 8566.12 found after 19 iterations and 2 nodes (0.22 seconds)
NLP0013I     11       OPT         9338.101979185836       18       0.032002
Cbc0011I Exiting as integer gap of 82.7249 less than 0 or 1%
Cbc0001I Search completed - best objective 8566.118961687705, took 37 iterations and 3 nodes (0.25 seconds)
Cbc0032I Strong branching done 3 times (91 iterations), fathomed 0 nodes and fixed 1 variables
Cbc0035I Maximum depth 1, 0 variables fixed on reduced cost

Bonmin finished. Found feasible point. Objective function = 8566.118962.
Resolve with fixed discrete variables to get dual values.
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         8566.118961687705       6        0.012001

MINLP solution:          8566.118962   (3 nodes, 0.28 seconds)
Best possible:           8566.118962
Absolute gap:                      0
Relative gap:                      0

GAMS/Bonmin finished.
--- Restarting execution
--- fuel.gms(89) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job fuel.gms Stop 09/02/08 16:24:55 elapsed 0:00:00.313