--- Job alan Start 09/05/08 00:12:03
GAMS Rev 228  Copyright (C) 1987-2008 GAMS Development. All rights reserved
*** License File has expired 4 days ago
Licensee: Stefan Vigerske                                G071106/0001CB-LNX
          Humboldt University Berlin, Numerical Mathematics          DC5918
--- Starting compilation
--- alan.gms(74) 2 Mb
--- Starting execution: elapsed 0:00:00.002
--- alan.gms(68) 3 Mb
--- Generating MINLP model m
--- alan.gms(73) 5 Mb
---   8 rows  9 columns  24 non-zeroes
---   66 nl-code  3 nl-non-zeroes
---   4 discrete-columns
--- alan.gms(73) 3 Mb
--- Executing BONMIN: elapsed 0:00:00.004

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
       bonmin.max_consecutive_infeasible = 3                     yes
             bonmin.nlp_failure_behavior = fathom                yes
       bonmin.num_resolve_at_infeasibles = 1                     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         2.899038461538461       7        0.012001
NLP0013I     2        OPT         2.982142857142859       21       0.032002
NLP0013I     3        OPT         2.89903846153846        5        0.004
NLP0013I     4        OPT         2.925                   22       0.032002
NLP0013I     5        OPT         2.899038461538464       5        0.004
NLP0013I     6        OPT         3.123529411764706       22       0.024002
NLP0013I     7        OPT         2.899038461538461       5        0.008
NLP0013I     8        INFEAS      6.812499999992263       18       0.040003
NLP0013I     9        OPT         2.899038461538461       5        0.004
NLP0013I     10       OPT         2.899038461538461       5        0.004001
Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 2.89904 (0.17 seconds)
NLP0013I     11       OPT         2.89903846153846        5        0.004
NLP0013I     12       OPT         2.924999999999998       23       0.032002
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         2.925000000173621       4        0.004001
Cbc0004I Integer solution of 2.925 found after 33 iterations and 2 nodes (0.22 seconds)
NLP0013I     13       OPT         2.982142857142859       21       0.032002
Cbc0011I Exiting as integer gap of 0.0259615 less than 0 or 1%
Cbc0001I Search completed - best objective 2.925000000173621, took 54 iterations and 3 nodes (0.25 seconds)
Cbc0032I Strong branching done 4 times (103 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 = 2.925000.
Resolve with fixed discrete variables to get dual values.
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         2.925000000173623       4        0.008

MINLP solution:                2.925   (3 nodes, 0.28 seconds)
Best possible:                 2.925
Absolute gap:             1.7764e-15
Relative gap:              6.073e-16

GAMS/Bonmin finished.
--- Restarting execution
--- alan.gms(73) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job alan.gms Stop 09/05/08 00:12:03 elapsed 0:00:00.303