--- Job acc-tight-1 Start 08/20/08 23:39:18
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-1.gms(106) 2 Mb
--- GDXin=/home/stefan/work/gams/models/LINlib/acc-tight-1.gdx
--- acc-tight-1.gms(148) 4 Mb
--- Starting execution: elapsed 0:00:00.036
--- acc-tight-1.gms(123) 4 Mb
--- Generating MIP model m
--- acc-tight-1.gms(124) 5 Mb
---   2,521 rows  1,621 columns  15,329 non-zeroes
---   1,620 discrete-columns
--- acc-tight-1.gms(124) 5 Mb
--- Executing COINCBC: elapsed 0:00:00.090

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

Calling CBC main solution routine...
Coin Cbc and Clp Solver version 2.00.00, build Mar 20 2008
command line - GAMS/CBC -solve -quit
Continuous objective value is 0 - 0.32 seconds
processed model has 2520 rows, 1620 columns (1620 integer) and 15327 elements
Objective coefficients multiple of 1
Cutoff increment increased from 1e-05 to 0.999
Pass   1: obj.   63.65407 --> up =    24 , down =     3
Pass   2: obj.   46.03991 --> up =    12 , down =     1
Pass   3: obj.   37.55049 --> up =     5 , down =     1
Pass   4: obj.   34.21802 --> up =     1 , down =     0
Pass   5: obj.   33.50046 --> up =     0 , down =     0 -- rand =   27 (  27)
Pass   6: obj.   34.00000 --> up =     9 , down =     9
Pass   7: obj.   19.16537 --> up =     5 , down =     5
Pass   8: obj.   15.09242 --> up =     1 , down =     0
Pass   9: obj.   14.36137 --> up =     0 , down =     0 -- rand =   15 (  15)
Pass  10: obj.   18.79795 --> up =     4 , down =     6
Pass  11: obj.   13.88664 --> up =     1 , down =     1
Pass  12: obj.   13.24197 --> up =     0 , down =     0 -- rand =   24 (  24)
Pass  13: obj.   23.23460 --> up =     6 , down =    10
Pass  14: obj.   10.00000 --> up =     6 , down =     4 - solution found of 0
Before mini branch and bound, 569 integers at bound fixed and 0 continuous
Full problem 2520 rows 1620 columns, reduced to 1966 rows 1048 columns - too large
Mini branch and bound did not improve solution (5.42 seconds)
After 5.42 seconds - Feasibility pump exiting - took 5.41 seconds
Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (5.50 seconds)
Search completed - best objective 0, took 0 iterations and 0 nodes (5.51 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 5.69 seconds (total time 6.01)
Total time 6.05

Solved to optimality.
Writing solution. Objective: 0 Time: 6.05 s
--- Restarting execution
--- acc-tight-1.gms(124) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job acc-tight-1.gms Stop 08/20/08 23:39:24 elapsed 0:00:06.233