--- Job meanvarx Start 09/06/08 10:40:28
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
--- meanvarx.gms(148) 2 Mb
--- Starting execution: elapsed 0:00:00.003
--- meanvarx.gms(143) 3 Mb
--- Generating MINLP model m
--- meanvarx.gms(148) 5 Mb
---   45 rows  36 columns  111 non-zeroes
---   346 nl-code  7 nl-non-zeroes
---   14 discrete-columns
--- meanvarx.gms(148) 3 Mb
--- Executing BONMIN: elapsed 0:00:00.005

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

List of user-set options:

                                    Name   Value                used
                        bonmin.algorithm = B-Hyb                 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         14.30978542909657       23       0.040003
OA0003I New best feasible of 14.5148 found after 0.056003 sec.
Cbc0012I Integer solution of 14.5148 found by noonlinear programm after 4 iterations and 0 nodes (0.06 seconds)
Cbc0031I 4 added rows had average density of 10
Cbc0013I At root node, 3 cuts changed objective from 14.3098 to 14.3682 in 2 passes
Cbc0014I Cut generator 0 (NLP solution based oa cuts) - 0 row cuts, 0 column cuts (0 active)
Cbc0014I Cut generator 1 (Mixed Integer Gomory) - 2 row cuts, 0 column cuts (2 active)
Cbc0014I Cut generator 2 (Probing) - 0 row cuts, 7 column cuts (1 active)
Cbc0014I Cut generator 3 (Mixed Integer Rounding) - 1 row cuts, 0 column cuts (0 active)
Cbc0014I Cut generator 4 (Cover) - 0 row cuts, 0 column cuts (0 active)
Cbc0014I Cut generator 5 (Clique) - 0 row cuts, 0 column cuts (0 active)
Cbc0014I Cut generator 6 (Flow Covers) - 0 row cuts, 0 column cuts (0 active)
Cbc0014I Cut generator 7 (Outer Approximation decomposition.) - 0 row cuts, 0 column cuts (0 active)
Cbc0014I Cut generator 8 (Outer Approximation feasibility check.) - 1 row cuts, 0 column cuts (0 active)
OA0003I New best feasible of 14.497 found after 0.16401 sec.
Cbc0016I Integer solution of 14.497 found by strong branching after 4 iterations and 0 nodes (0.16 seconds)
OA0003I New best feasible of 14.3692 found after 0.216013 sec.
Cbc0016I Integer solution of 14.3692 found by strong branching after 6 iterations and 0 nodes (0.22 seconds)
Cbc0001I Search completed - best objective 14.36923211509603, took 6 iterations and 0 nodes (0.27 seconds)
Cbc0032I Strong branching done 6 times (7 iterations), fathomed 1 nodes and fixed 1 variables
Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost
Mixed Integer Gomory was tried 2 times and created 2 cuts of which 2 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
Outer Approximation feasibility check. was tried 5 times and created 5 cuts of which 0 were active after adding rounds of cuts

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

MINLP solution:          14.36923211   (0 nodes, 0.31 seconds)
Best possible:           14.36923212
Absolute gap:             1.3781e-10
Relative gap:             9.5904e-12

GAMS/Bonmin finished.
--- Restarting execution
--- meanvarx.gms(148) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job meanvarx.gms Stop 09/06/08 10:40:29 elapsed 0:00:00.377