--- Job nous1 Start 09/02/08 23:39:03
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
--- nous1.gms(278) 2 Mb
--- Starting execution: elapsed 0:00:00.040
--- nous1.gms(273) 3 Mb
--- Generating MINLP model m
--- nous1.gms(278) 5 Mb
---   44 rows  51 columns  197 non-zeroes
---   607 nl-code  122 nl-non-zeroes
---   2 discrete-columns
--- nous1.gms(278) 3 Mb
--- Executing BONMIN: elapsed 0:00:00.043

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         0.8315367620547074      26       0.060004
NLP0013I     2        INFEAS      0.2193551917118992      67       0.196012
NLP0013I     3        OPT         1.496297773045764       83       0.176011
NLP0013I     4        OPT         1.496297773045764       83       0.184012
NLP0013I     5        INFEAS      1.143829465697691       234      0.760047
NLP0013I     6        OPT         1.625930877527026       62       0.136009
NLP0013I     7        OPT         1.625930877527026       62       0.140009
Restoration phase is called at point that is almost feasible,
  with constraint violation 5.210771e-11. Abort.
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        FAILED      1.670856885099524       95       0.256016
NLP0014I  *  r1       OPT         1.567072000127953       40       0.088005
Cbc0004I Integer solution of 1.56707 found after 145 iterations and 0 nodes (1.94 seconds)
Cbc0001I Search completed - best objective 1.567072000127953, took 145 iterations and 0 nodes (1.94 seconds)
Cbc0032I Strong branching done 2 times (446 iterations), fathomed 0 nodes and fixed 2 variables
Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost

Bonmin finished. Found feasible point. Objective function = 1.567072.
Resolve with fixed discrete variables to get dual values.
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         1.567072000125898       35       0.076005

MINLP solution:             1.567072   (0 nodes, 2.08 seconds)
Best possible:              1.567072
Absolute gap:              2.055e-12
Relative gap:             1.3114e-12

GAMS/Bonmin finished.
--- Restarting execution
--- nous1.gms(278) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job nous1.gms Stop 09/02/08 23:39:05 elapsed 0:00:02.165