--- Job minlphix Start 09/02/08 23:38:35
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
--- minlphix.gms(274) 2 Mb
--- Starting execution: elapsed 0:00:00.041
--- minlphix.gms(269) 3 Mb
--- Generating MINLP model m
--- minlphix.gms(274) 5 Mb
---   93 rows  85 columns  317 non-zeroes
---   521 nl-code  40 nl-non-zeroes
---   20 discrete-columns
--- minlphix.gms(274) 3 Mb
--- Executing BONMIN: elapsed 0:00:00.045

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
******************************************************************************

Restoration phase is called at point that is almost feasible,
  with constraint violation 3.349487e-12. Abort.
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        FAILED      -23995381.33505132      52       0.128008
Restoration phase is called at point that is almost feasible,
  with constraint violation 3.349487e-12. Abort.
NLP0014I     r1       FAILED      -23995381.33505132      52       0.128008
Cbc0006I The LP relaxation is infeasible or too expensive

Bonmin finished. No feasible point found.


GAMS/Bonmin finished.
--- Restarting execution
--- minlphix.gms(274) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job minlphix.gms Stop 09/02/08 23:38:35 elapsed 0:00:00.332