--- Job acc-tight-6 Start 08/23/08 21:49:47 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-6.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/acc-tight-6.gdx --- acc-tight-6.gms(148) 4 Mb --- Starting execution: elapsed 0:00:00.026 --- acc-tight-6.gms(123) 4 Mb --- Generating MIP model m --- acc-tight-6.gms(124) 5 Mb --- 3,053 rows 1,340 columns 16,136 non-zeroes --- 1,339 discrete-columns --- acc-tight-6.gms(124) 5 Mb --- Executing Cbc: elapsed 0:00:00.084 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 1339 columns and 3052 rows. 1339 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.95 seconds Optimal - objective value 0 4 variables fixed 165 fixed, 0 tightened bounds, 0 strengthened rows, 131 substitutions 165 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 0 strengthened rows, 86 substitutions 0 fixed, 0 tightened bounds, 0 strengthened rows, 29 substitutions 0 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions 0 fixed, 0 tightened bounds, 0 strengthened rows, 1 substitutions 0 fixed, 0 tightened bounds, 0 strengthened rows, 5 substitutions processed model has 2619 rows, 1083 columns (1083 integer) and 13615 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 63.26983 (481) obj. 0.0642698 iterations 2204 Pass 2: suminf. 57.69051 (475) obj. 0.146417 iterations 768 Pass 3: suminf. 52.95159 (483) obj. 0.149383 iterations 843 Pass 4: suminf. 50.23905 (460) obj. 0.170093 iterations 592 Pass 5: suminf. 48.14846 (493) obj. 0.212042 iterations 654 Pass 6: suminf. 47.45471 (487) obj. 0.206466 iterations 334 Pass 7: suminf. 47.27263 (484) obj. 0.220693 iterations 92 Pass 8: suminf. 47.40896 (490) obj. 0.239086 iterations 95 Pass 9: suminf. 47.64699 (466) obj. 0.212256 iterations 202 Pass 10: suminf. 47.77671 (455) obj. 0.204683 iterations 190 Pass 11: suminf. 47.70413 (464) obj. 0.209397 iterations 284 Pass 12: suminf. 47.83341 (463) obj. 0.20525 iterations 128 Pass 13: suminf. 47.95908 (473) obj. 0.246924 iterations 98 Pass 14: suminf. 68.06834 (423) obj. 0.124821 iterations 1116 Pass 15: suminf. 48.24853 (463) obj. 0.0552123 iterations 1569 Pass 16: suminf. 47.92860 (452) obj. 0.056345 iterations 436 Pass 17: suminf. 47.72577 (460) obj. 0.0758343 iterations 358 Pass 18: suminf. 47.40573 (470) obj. 0.0409463 iterations 114 Pass 19: suminf. 47.16580 (472) obj. 0.0702148 iterations 184 Pass 20: suminf. 46.71196 (450) obj. 0.124203 iterations 481 No solution found this major pass Before mini branch and bound, 167 integers at bound fixed and 0 continuous Full problem 2619 rows 1083 columns, reduced to 2353 rows 916 columns - too large Mini branch and bound did not improve solution (4.47 seconds) After 4.47 seconds - Feasibility pump exiting - took 4.46 seconds 53 added rows had average density of 80.3962 At root node, 53 cuts changed objective from 0 to 0 in 7 passes Cut generator 0 (Probing) - 366 row cuts, 0 column cuts (53 active) in 0.284 seconds - new frequency is 1 Cut generator 1 (Gomory) - 1157 row cuts, 0 column cuts (0 active) in 0.828 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in 0.012 seconds - new frequency is -100 Cut generator 3 (Clique) - 4 row cuts, 0 column cuts (0 active) in 0.028 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts, 0 column cuts (0 active) in 0.028 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.016 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 4 row cuts, 0 column cuts (0 active) in 0.388 seconds - new frequency is -100 Optimal - objective value 0 Optimal - objective value 0 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0 (11.60 seconds) After 100 nodes, 48 on tree, 1e+50 best solution, best possible 0 (197.38 seconds) After 200 nodes, 69 on tree, 1e+50 best solution, best possible 0 (324.94 seconds) After 300 nodes, 62 on tree, 1e+50 best solution, best possible 0 (414.73 seconds) After 400 nodes, 77 on tree, 1e+50 best solution, best possible 0 (465.59 seconds) After 500 nodes, 88 on tree, 1e+50 best solution, best possible 0 (536.32 seconds) Integer solution of 1 found after 942523 iterations and 544 nodes (563.47 seconds) After 600 nodes, 88 on tree, 1 best solution, best possible 0 (584.06 seconds) After 700 nodes, 91 on tree, 1 best solution, best possible 0 (606.59 seconds) After 800 nodes, 100 on tree, 1 best solution, best possible 0 (641.94 seconds) After 900 nodes, 104 on tree, 1 best solution, best possible 0 (674.11 seconds) After 1000 nodes, 108 on tree, 1 best solution, best possible 0 (710.31 seconds) After 1100 nodes, 118 on tree, 1 best solution, best possible 0 (756.84 seconds) After 1200 nodes, 125 on tree, 1 best solution, best possible 0 (799.55 seconds) After 1300 nodes, 123 on tree, 1 best solution, best possible 0 (837.14 seconds) After 1400 nodes, 125 on tree, 1 best solution, best possible 0 (874.71 seconds) After 1500 nodes, 128 on tree, 1 best solution, best possible 0 (916.85 seconds) After 1600 nodes, 127 on tree, 1 best solution, best possible 0 (944.03 seconds) After 1700 nodes, 131 on tree, 1 best solution, best possible 0 (990.94 seconds) After 1800 nodes, 146 on tree, 1 best solution, best possible 0 (1036.95 seconds) After 1900 nodes, 153 on tree, 1 best solution, best possible 0 (1083.49 seconds) After 2000 nodes, 160 on tree, 1 best solution, best possible 0 (1116.95 seconds) Integer solution of 0 found after 1744657 iterations and 2078 nodes (1134.99 seconds) Search completed - best objective 0, took 1744657 iterations and 2078 nodes (1135.00 seconds) Strong branching done 2084 times (22050 iterations), fathomed 5 nodes and fixed 3 variables Maximum depth 31, 105 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 590 times and created 13138 cuts of which 3546 were active after adding rounds of cuts (5.328 seconds) Gomory was tried 590 times and created 1409 cuts of which 0 were active after adding rounds of cuts (8.713 seconds) Knapsack was tried 7 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) Clique was tried 7 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.028 seconds) MixedIntegerRounding2 was tried 7 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.028 seconds) FlowCover was tried 7 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) TwoMirCuts was tried 7 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.388 seconds) implication was tried 1396 times and created 10597 cuts of which 654 were active after adding rounds of cuts Result - Finished objective 0 after 2078 nodes and 1744657 iterations - took 1137.96 seconds (total time 1138.92) Total time 1139.02 Solved to optimality. MIP solution: 0 (2078 nodes, 1139.03 seconds) Best possible: 0 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- acc-tight-6.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job acc-tight-6.gms Stop 08/23/08 22:08:47 elapsed 0:18:59.697