--- Job st_miqp5 Start 09/06/08 16:06:49
GAMS Rev 228  Copyright (C) 1987-2008 GAMS Development. All rights reserved
*** License File has expired 5 days ago
Licensee: Stefan Vigerske                                G071106/0001CB-LNX
          Humboldt University Berlin, Numerical Mathematics          DC5918
--- Starting compilation
--- st_miqp5.gms(94) 2 Mb
--- Starting execution: elapsed 0:00:00.001
--- st_miqp5.gms(89) 3 Mb
--- Generating MINLP model m
--- st_miqp5.gms(94) 5 Mb
---   14 rows  8 columns  75 non-zeroes
---   35 nl-code  2 nl-non-zeroes
---   2 discrete-columns
--- st_miqp5.gms(94) 3 Mb
--- Executing BONMIN: elapsed 0:00:00.003

GAMS/Bonmin MINLP Solver (Bonmin Library 0.99)
written by P. Bonami

List of user-set options:

                                    Name   Value                used
                        bonmin.algorithm = B-OA                  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         -333.8888888887013      14       0.020001
OA0003I New best feasible of -333.889 found after 0.040002 sec.
Cbc0012I Integer solution of -333.889 found by noonlinear programm after 0 iterations and 0 nodes (0.04 seconds)
Cbc0013I At root node, 0 cuts changed objective from -333.889 to -333.889 in 1 passes
Cbc0014I Cut generator 0 (Mixed Integer Gomory) - 0 row cuts, 0 column cuts (0 active)
Cbc0014I Cut generator 1 (Probing) - 0 row cuts, 0 column cuts (0 active)
Cbc0014I Cut generator 2 (Mixed Integer Rounding) - 0 row cuts, 0 column cuts (0 active)
Cbc0014I Cut generator 3 (Cover) - 0 row cuts, 0 column cuts (0 active)
Cbc0014I Cut generator 4 (Clique) - 0 row cuts, 0 column cuts (0 active)
Cbc0014I Cut generator 5 (Flow Covers) - 0 row cuts, 0 column cuts (0 active)
Cbc0014I Cut generator 6 (Outer Approximation decomposition.) - 0 row cuts, 0 column cuts (0 active)
Cbc0014I Cut generator 7 (Outer Approximation feasibility check.) - 2 row cuts, 0 column cuts (0 active)
Cbc0001I Search completed - best objective -333.8888888887802, took 0 iterations and 0 nodes (0.04 seconds)
Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost
Outer Approximation feasibility check. was tried 1 times and created 2 cuts of which 0 were active after adding rounds of cuts

Bonmin finished. Found feasible point. Objective function = -333.888889.
Resolve with fixed discrete variables to get dual values.

MINLP solution:         -333.8888889   (0 nodes, 0.06 seconds)
Best possible:          -333.8888889
Absolute gap:             5.6843e-14
Relative gap:             1.7025e-16

GAMS/Bonmin finished.
--- Restarting execution
--- st_miqp5.gms(94) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job st_miqp5.gms Stop 09/06/08 16:06:49 elapsed 0:00:00.118