--- Job prob02 Start 09/03/08 07:14:51
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
--- prob02.gms(76) 2 Mb
--- Starting execution: elapsed 0:00:00.028
--- prob02.gms(71) 3 Mb
--- Generating MINLP model m
--- prob02.gms(76) 5 Mb
---   9 rows  7 columns  32 non-zeroes
---   56 nl-code  10 nl-non-zeroes
---   6 discrete-columns
--- prob02.gms(76) 3 Mb
--- Executing BONMIN: elapsed 0:00:00.030

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         110250.84745754         7        0.012001
NLP0013I     2        INFEAS      104000                  15       0.036002
NLP0013I     3        OPT         112235.0000000049       8        0.012001
NLP0013I     4        OPT         112235.0000000049       8        0.012001
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         112235                  0        0
Cbc0004I Integer solution of 112235 found after 8 iterations and 0 nodes (0.06 seconds)
Cbc0001I Search completed - best objective 112235, took 8 iterations and 0 nodes (0.06 seconds)
Cbc0032I Strong branching done 1 times (23 iterations), fathomed 0 nodes and fixed 1 variables
Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost

Bonmin finished. Found feasible point. Objective function = 112235.000000.
All variables are discrete. Dual variables for fixed problem will be not available.
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         112235                  0        0

MINLP solution:               112235   (0 nodes, 0.08 seconds)
Best possible:                112235
Absolute gap:                      0
Relative gap:                      0

GAMS/Bonmin finished.
--- Restarting execution
--- prob02.gms(76) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job prob02.gms Stop 09/03/08 07:14:51 elapsed 0:00:00.128