--- Job acc-tight-0 Start 08/21/08 16:01:31
GAMS Rev 228  Copyright (C) 1987-2008 GAMS Development. All rights reserved
Licensee: Stefan Vigerske                                G071106/0001CB-LNX
          Humboldt University Berlin, Numerical Mathematics          DC5918
--- Starting compilation
--- acc-tight-0.gms(106) 2 Mb
--- GDXin=/home/stefan/work/gams/models/LINlib/acc-tight-0.gdx
--- acc-tight-0.gms(148) 3 Mb
--- Starting execution: elapsed 0:00:00.015
--- acc-tight-0.gms(123) 4 Mb
--- Generating MIP model m
--- acc-tight-0.gms(124) 4 Mb
---   1,738 rows  1,621 columns  7,292 non-zeroes
---   1,620 discrete-columns
--- acc-tight-0.gms(124) 4 Mb
--- Executing COINCBC: elapsed 0:00:00.047

GAMS/CoinCbc 2.1 LP/MIP Solver
written by J. Forrest
Problem statistics: 1620 columns and 1737 rows.
                    1620 variables have integrality restrictions.

Calling CBC main solution routine...
Coin Cbc and Clp Solver version 2.10.00, build Jun 21 2008
command line - GAMS/CBC -solve -quit
Continuous objective value is 0 - 0.17 seconds
processed model has 1737 rows, 1620 columns (1620 integer) and 7290 elements
Objective coefficients multiple of 1
Cutoff increment increased from 1e-05 to 0.999
Pass   1: suminf.   39.47052 obj. 0 iterations 1713
Pass   2: suminf.   24.67082 obj. 0 iterations 1415
Pass   3: suminf.   22.02703 obj. 0 iterations 1013
Pass   4: suminf.   19.34783 obj. 0 iterations 1352
Pass   5: suminf.   14.00000 obj. 0 iterations 1813
Pass   6: suminf.    0.00000 obj. 0 iterations 604
Solution found of 0
Before mini branch and bound, 1135 integers at bound fixed and 0 continuous
Full problem 1737 rows 1620 columns, reduced to 515 rows 424 columns
Mini branch and bound did not improve solution (6.06 seconds)
After 6.06 seconds - Feasibility pump exiting with objective of 0 - took 6.06 seconds
Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (6.09 seconds)
Full problem 1737 rows 1620 columns, reduced to 0 rows 0 columns
Search completed - best objective 0, took 0 iterations and 0 nodes (6.11 seconds)
Maximum depth 0, 0 variables fixed on reduced cost
Cuts at root node changed objective from 0 to 0
Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Result - Finished objective 0 after 0 nodes and 0 iterations - took 6.26 seconds (total time 6.44)
Total time 6.46

Solved to optimality.
MIP solution:                     0   (0 nodes, 6.46 seconds)
Best possible:                    0
Absolute gap:                     0   (absolute tolerance optca: 0)
Relative gap:                     0   (relative tolerance optcr: 0)
--- Restarting execution
--- acc-tight-0.gms(124) 0 Mb
--- Reading solution for model m
--- acc-tight-0.gms(124) 3 Mb
*** Status: Normal completion
--- Job acc-tight-0.gms Stop 08/21/08 16:01:38 elapsed 0:00:06.564