--- Job gkocis Start 09/02/08 19:28:03
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
--- gkocis.gms(68) 2 Mb
--- Starting execution: elapsed 0:00:00.019
--- gkocis.gms(63) 3 Mb
--- Generating MINLP model m
--- gkocis.gms(68) 5 Mb
---   9 rows  12 columns  28 non-zeroes
---   22 nl-code  2 nl-non-zeroes
---   3 discrete-columns
--- gkocis.gms(68) 3 Mb
--- Executing BONMIN: elapsed 0:00:00.021

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         -6.299931884659256      9        0.012001
NLP0013I     2        OPT         1.267355137784189e-10   27       0.036002
NLP0013I     3        OPT         -3.577709662384813      5        0.004001
NLP0013I     4        OPT         -5.03611817636544       24       0.032002
NLP0013I     5        OPT         -5.030107020869528      6        0.012001
NLP0013I     6        OPT         -5.688059638465946      24       0.032002
NLP0013I     7        OPT         -5.428598241976505      5        0.008
Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible -6.29993 (0.13 seconds)
NLP0013I     8        OPT         -3.577709662384813      5        0.008001
NLP0013I     9        OPT         -2.313895954210881      28       0.056003
NLP0013I     10       OPT         -1.720971686295995      21       0.028002
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         -1.720971688972051      18       0.024002
Cbc0004I Integer solution of -1.72097 found after 54 iterations and 3 nodes (0.25 seconds)
NLP0013I     11       OPT         0.2777777778063188      25       0.036002
NLP0013I     12       OPT         -2.307884798657306      6        0.012001
NLP0013I     13       OPT         -1.923098737748012      21       0.028001
NLP0013I     2        OPT         -1.923098737624207      5        0.008001
Cbc0004I Integer solution of -1.9231 found after 106 iterations and 6 nodes (0.34 seconds)
NLP0013I     14       OPT         -1.411002034817884      5        0.008
NLP0013I     15       OPT         1.267355137784189e-10   27       0.036002
Cbc0001I Search completed - best objective -1.923098737624207, took 138 iterations and 8 nodes (0.38 seconds)
Cbc0032I Strong branching done 3 times (91 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 = -1.923099.
Resolve with fixed discrete variables to get dual values.
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         -1.923098737624207      5        0.008

MINLP solution:         -1.923098738   (8 nodes, 0.41 seconds)
Best possible:          -1.923098738
Absolute gap:                      0
Relative gap:                      0

GAMS/Bonmin finished.
--- Restarting execution
--- gkocis.gms(68) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job gkocis.gms Stop 09/02/08 19:28:03 elapsed 0:00:00.453