--- Job du-opt5 Start 09/06/08 14:43:14
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
--- du-opt5.gms(685) 2 Mb
--- Starting execution: elapsed 0:00:00.009
--- du-opt5.gms(680) 3 Mb
--- Generating MINLP model m
--- du-opt5.gms(685) 5 Mb
---   10 rows  21 columns  47 non-zeroes
---   14,783 nl-code  20 nl-non-zeroes
---   12 discrete-columns
--- du-opt5.gms(685) 3 Mb
--- Executing BONMIN: elapsed 0:00:00.021

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         3.934719197352986       21       0.060004
OA0003I New best feasible of 28.3546 found after 0.036003 sec.
Cbc0012I Integer solution of 28.3546 found by noonlinear programm after 2 iterations and 0 nodes (0.04 seconds)
Cbc0031I 3 added rows had average density of 9.33333
Cbc0013I At root node, 2 cuts changed objective from 3.93472 to 4.52104 in 2 passes
Cbc0014I Cut generator 0 (Mixed Integer Gomory) - 2 row cuts, 0 column cuts (2 active)
Cbc0014I Cut generator 1 (Probing) - 0 row cuts, 1 column cuts (0 active)
Cbc0014I Cut generator 2 (Mixed Integer Rounding) - 1 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)
Cbc0010I After 0 nodes, 1 on tree, 28.3546 best solution, best possible 4.52104 (0.07 seconds)
OA0003I New best feasible of 14.1266 found after 0.648041 sec.
Cbc0016I Integer solution of 14.1266 found by strong branching after 183 iterations and 17 nodes (0.65 seconds)
OA0003I New best feasible of 11.1388 found after 0.716045 sec.
Cbc0012I Integer solution of 11.1388 found by noonlinear programm after 193 iterations and 19 nodes (0.75 seconds)
OA0003I New best feasible of 9.71652 found after 1.00406 sec.
Cbc0016I Integer solution of 9.71652 found by strong branching after 230 iterations and 24 nodes (1.00 seconds)
OA0003I New best feasible of 9.3784 found after 1.6401 sec.
Cbc0016I Integer solution of 9.3784 found by strong branching after 655 iterations and 81 nodes (1.64 seconds)
OA0003I New best feasible of 8.49584 found after 1.96012 sec.
Cbc0012I Integer solution of 8.49584 found by noonlinear programm after 835 iterations and 99 nodes (1.96 seconds)
Cbc0010I After 100 nodes, 24 on tree, 8.49584 best solution, best possible 4.52104 (1.96 seconds)
OA0003I New best feasible of 8.30728 found after 3.10419 sec.
Cbc0012I Integer solution of 8.30728 found by noonlinear programm after 1322 iterations and 163 nodes (3.10 seconds)
Cbc0010I After 200 nodes, 33 on tree, 8.30728 best solution, best possible 6.20967 (3.38 seconds)
Cbc0010I After 300 nodes, 73 on tree, 8.30728 best solution, best possible 6.82361 (3.86 seconds)
OA0003I New best feasible of 8.11483 found after 5.12432 sec.
Cbc0004I Integer solution of 8.11483 found after 2746 iterations and 345 nodes (5.12 seconds)
Cbc0010I After 400 nodes, 79 on tree, 8.11483 best solution, best possible 7.11577 (5.61 seconds)
Cbc0010I After 500 nodes, 75 on tree, 8.11483 best solution, best possible 7.4288 (5.95 seconds)
OA0003I New best feasible of 8.07366 found after 6.15238 sec.
Cbc0004I Integer solution of 8.07366 found after 4270 iterations and 578 nodes (6.15 seconds)
Cbc0010I After 600 nodes, 42 on tree, 8.07366 best solution, best possible 7.72798 (6.20 seconds)
Cbc0001I Search completed - best objective 8.073657582023539, took 4844 iterations and 692 nodes (6.54 seconds)
Cbc0032I Strong branching done 156 times (248 iterations), fathomed 3 nodes and fixed 7 variables
Cbc0035I Maximum depth 16, 0 variables fixed on reduced cost
Mixed Integer Gomory was tried 594 times and created 741 cuts of which 149 were active after adding rounds of cuts
Probing was tried 594 times and created 351 cuts of which 2 were active after adding rounds of cuts
Mixed Integer Rounding was tried 594 times and created 2 cuts of which 0 were active after adding rounds of cuts
Outer Approximation feasibility check. was tried 102 times and created 239 cuts of which 0 were active after adding rounds of cuts

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

MINLP solution:           8.07365758   (692 nodes, 6.56 seconds)
Best possible:           8.073657582
Absolute gap:             1.8056e-09
Relative gap:             2.2365e-10

GAMS/Bonmin finished.
--- Restarting execution
--- du-opt5.gms(685) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job du-opt5.gms Stop 09/06/08 14:43:20 elapsed 0:00:06.687