--- Job mbtd Start 09/02/08 22:31:24
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
--- mbtd.gms(27231) 9 Mb
--- Starting execution: elapsed 0:00:00.684
--- mbtd.gms(27226) 9 Mb
--- Generating MINLP model m
--- mbtd.gms(27231) 20 Mb
---   71 rows  211 columns  1,841 non-zeroes
---   1,932,301 nl-code  1,400 nl-non-zeroes
---   200 discrete-columns
--- mbtd.gms(27231) 10 Mb
--- Executing BONMIN: elapsed 0:00:01.655

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         7.425000000099978       8        16.8291
NLP0013I     2        OPT         4.438126011466926       290      676.094
NLP0013I     3        OPT         7.5833333334676         7        14.2089
NLP0013I     4        OPT         4.474694219967789       431      1000.81
NLP0013I     5        OPT         7.583333333467605       7        14.3449
NLP0013I     6        OPT         4.454632012459351       354      831.1
NLP0013I     7        OPT         7.583333333467603       7        14.0929
NLP0013I     8        OPT         4.454632012458982       368      848.293
NLP0013I     9        OPT         7.583333333467605       7        14.3289
NLP0013I     10       INFEAS      4.536977322373222       260      590.549
NLP0013I     11       INFEAS      7.425000000099978       0        0.068004
Cbc0003I Exiting on maximum nodes
Cbc0005I Partial search - best objective 1e+50 (best possible 7.425), took 0 iterations and 0 nodes (4003.91 seconds)
Cbc0032I Strong branching done 5 times (1731 iterations), fathomed 1 nodes and fixed 0 variables
Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost
NLP0013I     12       INFEAS      7.425000000099978       0        0.072004
Time limit exceeded.

Bonmin finished. No feasible point found.

Best possible:                 7.425

GAMS/Bonmin finished.
--- Restarting execution
--- mbtd.gms(27231) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job mbtd.gms Stop 09/02/08 23:38:34 elapsed 1:07:10.314