--- Job sep1 Start 09/03/08 08:26:18
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
--- sep1.gms(152) 2 Mb
--- Starting execution: elapsed 0:00:00.035
--- sep1.gms(147) 3 Mb
--- Generating MINLP model m
--- sep1.gms(152) 5 Mb
---   32 rows  30 columns  99 non-zeroes
---   67 nl-code  12 nl-non-zeroes
---   2 discrete-columns
--- sep1.gms(152) 3 Mb
--- Executing BONMIN: elapsed 0:00:00.038

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         -518.1342913438427      19       0.032002
NLP0013I     2        OPT         -470.1300897944574      21       0.032002
NLP0013I     3        OPT         -511.7946607817501      12       0.016001
Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible -518.134 (0.05 seconds)
NLP0013I     4        OPT         -511.7946607817501      12       0.016001
NLP0013I     5        OPT         -477.878587006388       29       0.040002
NLP0013I     6        OPT         -510.0809843529858      11       0.016001
NLP0013I     7        OPT         -510.0809843529858      11       0.020001
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         -510.0809843529923      8        0.012001
Cbc0004I Integer solution of -510.081 found after 23 iterations and 2 nodes (0.17 seconds)
NLP0013I     8        OPT         -477.878587006388       29       0.044002
NLP0013I     9        OPT         -470.1300897944574      21       0.032002
Cbc0001I Search completed - best objective -510.0809843529923, took 73 iterations and 4 nodes (0.24 seconds)
Cbc0032I Strong branching done 2 times (73 iterations), fathomed 0 nodes and fixed 0 variables
Cbc0035I Maximum depth 1, 0 variables fixed on reduced cost

Bonmin finished. Found feasible point. Objective function = -510.080984.
Resolve with fixed discrete variables to get dual values.
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         -510.0809843529926      8        0.012

MINLP solution:         -510.0809844   (4 nodes, 0.3 seconds)
Best possible:          -510.0809844
Absolute gap:             2.2737e-13
Relative gap:             4.4576e-16

GAMS/Bonmin finished.
--- Restarting execution
--- sep1.gms(152) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job sep1.gms Stop 09/03/08 08:26:18 elapsed 0:00:00.356