--- Job st_miqp1 Start 09/06/08 16:06:48
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_miqp1.gms(55) 2 Mb
--- Starting execution: elapsed 0:00:00.002
--- st_miqp1.gms(50) 3 Mb
--- Generating MINLP model m
--- st_miqp1.gms(55) 5 Mb
---   2 rows  6 columns  11 non-zeroes
---   83 nl-code  5 nl-non-zeroes
---   5 discrete-columns
--- st_miqp1.gms(55) 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         240.0656687899611       8        0.012001
OA0003I New best feasible of 381.5 found after 0 sec.
Cbc0012I Integer solution of 381.5 found by noonlinear programm after 5 iterations and 0 nodes (0.00 seconds)
Cbc0031I 3 added rows had average density of 4
Cbc0013I At root node, 3 cuts changed objective from 240.066 to 268.858 in 2 passes
Cbc0014I Cut generator 0 (Mixed Integer Gomory) - 1 row cuts, 0 column cuts (1 active)
Cbc0014I Cut generator 1 (Probing) - 0 row cuts, 1 column cuts (1 active)
Cbc0014I Cut generator 2 (Mixed Integer Rounding) - 1 row cuts, 0 column cuts (0 active)
Cbc0014I Cut generator 3 (Cover) - 2 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)
OA0003I New best feasible of 281 found after 0 sec.
Cbc0016I Integer solution of 281 found by strong branching after 5 iterations and 0 nodes (0.00 seconds)
Cbc0001I Search completed - best objective 281, took 5 iterations and 0 nodes (0.00 seconds)
Cbc0032I Strong branching done 6 times (7 iterations), fathomed 1 nodes and fixed 0 variables
Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost
Mixed Integer Gomory was tried 2 times and created 1 cuts of which 1 were active after adding rounds of cuts
Mixed Integer Rounding was tried 2 times and created 1 cuts of which 0 were active after adding rounds of cuts
Cover was tried 2 times and created 2 cuts of which 0 were active after adding rounds of cuts
Outer Approximation feasibility check. was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts

Bonmin finished. Found feasible point. Objective function = 281.000000.
All variables are discrete. Dual variables for fixed problem will be not available.

MINLP solution:                  281   (0 nodes, 0.01 seconds)
Best possible:                   281
Absolute gap:                      0
Relative gap:                      0

GAMS/Bonmin finished.
--- Restarting execution
--- st_miqp1.gms(55) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job st_miqp1.gms Stop 09/06/08 16:06:48 elapsed 0:00:00.046