--- Job acc-tight-4 Start 08/21/08 00:44:30 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.040 --- 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 COINCBC: elapsed 0:00:00.088 GAMS/CoinCbc 2.0 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.00.00, build Mar 20 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 0 - 0.27 seconds 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: obj. 68.43103 --> up = 25 , down = 3 Pass 2: obj. 49.66560 --> up = 21 , down = 5 Pass 3: obj. 29.80218 --> up = 10 , down = 5 Pass 4: obj. 17.91234 --> up = 0 , down = 1 Pass 5: obj. 17.00000 --> up = 17 , down = 13 Pass 6: obj. 16.00000 --> up = 8 , down = 8 - solution found of 1 Before mini branch and bound, 888 integers at bound fixed and 0 continuous Full problem 2286 rows 1620 columns, reduced to 1352 rows 711 columns - too large Mini branch and bound did not improve solution (2.04 seconds) Round again with cutoff of 0.9 Reduced cost fixing fixed 1 variables on pass 2 Pass 7: obj. 68.49086 --> up = 24 , down = 5 Pass 8: obj. 49.15792 --> up = 18 , down = 3 Pass 9: obj. 31.73874 --> up = 11 , down = 7 Pass 10: obj. 20.09171 --> up = 9 , down = 3 Pass 11: obj. 12.27907 --> up = 0 , down = 0 -- rand = 22 ( 22) Pass 12: obj. 18.00000 --> up = 4 , down = 14 Pass 13: obj. 12.00000 --> up = 10 , down = 1 Pass 14: obj. 12.00000 --> up = 3 , down = 11 Pass 15: obj. 12.00000 --> up = 0 , down = 3 Pass 16: obj. 12.00000 --> up = 0 , down = 0 -- rand = 23 ( 23) Pass 17: obj. 12.00000 --> up = 1 , down = 12 Pass 18: obj. 12.00000 --> up = 0 , down = 12 perturbation applied Pass 19: obj. 234.85778 --> up = 12 , down = 220 Pass 20: obj. 42.24569 --> up = 13 , down = 4 Pass 21: obj. 29.24782 --> up = 4 , down = 2 Pass 22: obj. 25.72296 --> up = 7 , down = 4 Pass 23: obj. 16.00000 --> up = 11 , down = 5 - solution found of 0 Before mini branch and bound, 670 integers at bound fixed and 0 continuous Full problem 2286 rows 1620 columns, reduced to 1616 rows 939 columns - too large Mini branch and bound did not improve solution (8.00 seconds) After 8.00 seconds - Feasibility pump exiting - took 7.99 seconds Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (8.08 seconds) Search completed - best objective 0, took 0 iterations and 0 nodes (8.08 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 8.25 seconds (total time 8.53) Total time 8.56 Solved to optimality. Writing solution. Objective: 0 Time: 8.56 s --- Restarting execution --- acc-tight-4.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job acc-tight-4.gms Stop 08/21/08 00:44:39 elapsed 0:00:08.710