--- Job acc-tight-4 Start 08/23/08 21:45:35
GAMS Rev 227  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-4.gms(106) 2 Mb
--- GDXin=/home/stefan/work/gams/models/LINlib/acc-tight-4.gdx
--- acc-tight-4.gms(148) 4 Mb
--- Starting execution: elapsed 0:00:00.022
--- acc-tight-4.gms(123) 4 Mb
--- Generating MIP model m
--- acc-tight-4.gms(124) 5 Mb
---   2,287 rows  1,621 columns  12,980 non-zeroes
---   1,620 discrete-columns
--- acc-tight-4.gms(124) 5 Mb
--- Executing Cbc: elapsed 0:00:00.070

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

Calling CBC main solution routine...
Coin Cbc and Clp Solver version 2.20.00, build Aug 23 2008
command line - GAMS/CBC -solve -quit
Continuous objective value is 0 - 0.26 seconds
Optimal - objective value 0
processed model has 2286 rows, 1620 columns (1620 integer) and 12978 elements
Objective coefficients multiple of 1
Cutoff increment increased from 1e-05 to 0.999
Pass   1: suminf.   60.32746 (334) obj. 0 iterations 1909
Pass   2: suminf.   42.54166 (341) obj. 0 iterations 1490
Pass   3: suminf.   32.72140 (279) obj. 0 iterations 1762
Pass   4: suminf.   21.00000 (42) obj. 0 iterations 2058
Pass   5: suminf.    0.00000 (0) obj. 0 iterations 897
Solution found of 0
Before mini branch and bound, 920 integers at bound fixed and 0 continuous
Mini branch and bound did not improve solution (2.45 seconds)
After 2.45 seconds - Feasibility pump exiting with objective of 0 - took 2.44 seconds
Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (2.52 seconds)
Full problem 2286 rows 1620 columns, reduced to 0 rows 0 columns
Optimal - objective value 0
Optimal - objective value 0
Search completed - best objective 0, took 0 iterations and 0 nodes (2.55 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 2.72 seconds (total time 2.99)
Total time 3.04

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