--- Job procsel 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
--- procsel.gms(65) 2 Mb
--- Starting execution: elapsed 0:00:00.032
--- procsel.gms(60) 3 Mb
--- Generating MINLP model m
--- procsel.gms(65) 5 Mb
---   8 rows  11 columns  26 non-zeroes
---   17 nl-code  2 nl-non-zeroes
---   3 discrete-columns
--- procsel.gms(65) 3 Mb
--- Executing BONMIN: elapsed 0:00:00.034

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.350211987629795      8        0.012001
NLP0013I     2        OPT         1.246629711574428e-10   28       0.036003
NLP0013I     3        OPT         -3.600211987195469      5        0.008
NLP0013I     4        OPT         -4.193193911471127      27       0.032002
NLP0013I     5        OPT         -4.055823708540563      5        0.004001
NLP0013I     6        OPT         -4.839765404363259      24       0.032002
NLP0013I     7        OPT         -4.470410254591391      5        0.008
Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible -5.35021 (0.13 seconds)
NLP0013I     8        OPT         -3.600211987195469      5        0.008001
NLP0013I     9        OPT         -2.443193911317434      24       0.028002
NLP0013I     10       OPT         -1.720971674910069      14       0.016001
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         -1.720971688921193      20       0.024002
Cbc0004I Integer solution of -1.72097 found after 43 iterations and 3 nodes (0.22 seconds)
NLP0013I     11       OPT         0.2777777778874535      27       0.036002
NLP0013I     12       OPT         -2.305823708741638      5        0.004001
NLP0013I     13       OPT         -1.923098737748012      26       0.032002
NLP0013I     2        OPT         -1.923098737748012      19       0.024002
Cbc0004I Integer solution of -1.9231 found after 101 iterations and 6 nodes (0.33 seconds)
NLP0013I     14       OPT         -1.411002033654352      5        0.008
NLP0013I     15       OPT         1.246629711574428e-10   28       0.036003
Cbc0001I Search completed - best objective -1.923098737748012, took 134 iterations and 8 nodes (0.38 seconds)
Cbc0032I Strong branching done 3 times (94 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.923098737748012      19       0.028001

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

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