--- Job pb351595 Start 09/03/08 06:07:56
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
--- pb351595.gms(57118) 18 Mb
--- Starting execution: elapsed 0:00:01.252
--- pb351595.gms(57113) 18 Mb
--- Generating MINLP model m
--- pb351595.gms(57118) 55 Mb
---   51 rows  526 columns  1,576 non-zeroes
---   2,751,528 nl-code  525 nl-non-zeroes
---   525 discrete-columns
--- pb351595.gms(57118) 42 Mb
--- Executing BONMIN: elapsed 0:00:03.247

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         6078159.735247933       19       546.206
NLP0013I     2        OPT         6080638.392229661       15       428.987
NLP0013I     3        OPT         6089240.424857495       29       828.152
NLP0013I     4        OPT         6085382.923265221       16       456.701
NLP0013I     5        OPT         6093072.482812196       30       857.222
NLP0013I     6        OPT         6089276.406641148       15       428.835
NLP0013I     7        INFEAS      6090036.435993467       15       428.831
NLP0013I     8        INFEAS      8216888.855700472       0        0.132008
Cbc0003I Exiting on maximum nodes
Cbc0005I Partial search - best objective 1e+50 (best possible 6.07816e+06), took 0 iterations and 0 nodes (3428.98 seconds)
Cbc0032I Strong branching done 3 times (120 iterations), fathomed 0 nodes and fixed 1 variables
Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost
NLP0013I     9        INFEAS      0                       0        0
Time limit exceeded.

Bonmin finished. No feasible point found.

Best possible:           6078159.735

GAMS/Bonmin finished.
--- Restarting execution
--- pb351595.gms(57118) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job pb351595.gms Stop 09/03/08 07:14:51 elapsed 1:06:54.542