--- Job acc-tight-5 Start 08/21/08 16:55:24 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-5.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/acc-tight-5.gdx --- acc-tight-5.gms(148) 4 Mb --- Starting execution: elapsed 0:00:00.020 --- acc-tight-5.gms(123) 4 Mb --- Generating MIP model m --- acc-tight-5.gms(124) 5 Mb --- 3,250 rows 1,621 columns 16,787 non-zeroes --- 1,620 discrete-columns --- acc-tight-5.gms(124) 5 Mb --- Executing COINCBC: elapsed 0:00:00.078 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 1620 columns and 3249 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 - 1.02 seconds 0 fixed, 0 tightened bounds, 0 strengthened rows, 238 substitutions processed model has 3487 rows, 1620 columns (1620 integer) and 17261 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: (1.44 seconds) suminf. 73.42868 obj. 0 iterations 3727 Pass 2: (2.64 seconds) suminf. 59.56237 obj. 0 iterations 3075 Pass 3: (3.24 seconds) suminf. 54.28290 obj. 0 iterations 1573 Pass 4: (3.80 seconds) suminf. 49.07118 obj. 0 iterations 1438 Pass 5: (4.21 seconds) suminf. 47.94015 obj. 0 iterations 1053 Pass 6: (4.49 seconds) suminf. 47.07629 obj. 0 iterations 681 Pass 7: (4.62 seconds) suminf. 47.00169 obj. 0 iterations 273 Pass 8: (5.06 seconds) suminf. 44.48211 obj. 0 iterations 1104 Pass 9: (5.65 seconds) suminf. 39.86935 obj. 0.00300198 iterations 1493 Pass 10: (6.40 seconds) suminf. 35.87278 obj. 0 iterations 1903 Pass 11: (6.88 seconds) suminf. 31.04332 obj. 0 iterations 1204 Pass 12: (7.35 seconds) suminf. 29.69380 obj. 0 iterations 1176 Pass 13: (7.46 seconds) suminf. 29.67393 obj. 0 iterations 228 Pass 14: (8.16 seconds) suminf. 30.25014 obj. 0 iterations 1754 Pass 15: (8.99 seconds) suminf. 28.03252 obj. 0 iterations 2180 Pass 16: (10.08 seconds) suminf. 26.63970 obj. 0.00527659 iterations 2827 Pass 17: (10.48 seconds) suminf. 23.95688 obj. 0 iterations 989 Pass 18: (10.98 seconds) suminf. 22.17359 obj. 0 iterations 1274 Pass 19: (11.50 seconds) suminf. 21.44328 obj. 0 iterations 1286 Pass 20: (11.84 seconds) suminf. 22.05532 obj. 0 iterations 820 No solution found this major pass Before mini branch and bound, 248 integers at bound fixed and 0 continuous Full problem 3487 rows 1620 columns, reduced to 2826 rows 1304 columns - too large Mini branch and bound did not improve solution (12.00 seconds) After 12.00 seconds - Feasibility pump exiting - took 11.99 seconds 94 added rows had average density of 518.755 At root node, 94 cuts changed objective from 0 to 0 in 3 passes Cut generator 0 (Probing) - 773 row cuts (61 active), 0 column cuts in 0.116 seconds - new frequency is 1 Cut generator 1 (Gomory) - 479 row cuts (33 active), 0 column cuts in 1.208 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.020 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in 0.020 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 0 row cuts (0 active), 0 column cuts in 0.388 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0 (50.96 seconds) After 100 nodes, 53 on tree, 1e+50 best solution, best possible 0 (248.70 seconds) Integer solution of 0 found after 228327 iterations and 191 nodes (365.98 seconds) Search completed - best objective 0, took 228327 iterations and 191 nodes (365.98 seconds) Strong branching done 3648 times (355459 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 39, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 138 times and created 1160 cuts of which 339 were active after adding rounds of cuts (0.416 seconds) Gomory was tried 138 times and created 524 cuts of which 38 were active after adding rounds of cuts (3.608 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.020 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.020 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) TwoMirCuts was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.388 seconds) Result - Finished objective 0 after 191 nodes and 228327 iterations - took 366.25 seconds (total time 367.27) Total time 367.29 Solved to optimality. MIP solution: 0 (191 nodes, 367.3 seconds) Best possible: 0 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- acc-tight-5.gms(124) 0 Mb --- Reading solution for model m --- acc-tight-5.gms(124) 3 Mb *** Status: Normal completion --- Job acc-tight-5.gms Stop 08/21/08 17:01:34 elapsed 0:06:10.614