--- Job cap6000 Start 08/21/08 04:21:16 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 --- cap6000.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/cap6000.gdx --- cap6000.gms(148) 5 Mb --- Starting execution: elapsed 0:00:00.087 --- cap6000.gms(123) 5 Mb --- Generating MIP model m --- cap6000.gms(124) 7 Mb --- 2,177 rows 6,001 columns 54,239 non-zeroes --- 6,000 discrete-columns --- cap6000.gms(124) 7 Mb --- Executing COINCBC: elapsed 0:00:00.235 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 6000 columns and 2176 rows. 6000 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 -2.45154e+06 - 0.05 seconds 46 fixed, 0 tightened bounds, 46 strengthened rows, 0 substitutions 84 fixed, 0 tightened bounds, 46 strengthened rows, 0 substitutions 8 fixed, 0 tightened bounds, 0 strengthened rows, 40 substitutions 0 fixed, 0 tightened bounds, 0 strengthened rows, 40 substitutions processed model has 1926 rows, 5799 columns (5799 integer) and 17316 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: obj. 0.02047 --> up = 0 , down = 0 -- rand = 1 ( 21) Pass 2: obj. 0.73387 --> up = 0 , down = 1 - solution found of -2.35432e+06 Before mini branch and bound, 5795 integers at bound fixed and 0 continuous Full problem 1926 rows 5799 columns, reduced to 2 rows 4 columns Mini branch and bound improved solution from -2.35432e+06 to -2.4428e+06 (0.08 seconds) Round again with cutoff of -2.44367e+06 Reduced cost fixing fixed 1794 variables on pass 2 Pass 3: obj. 0.02047 --> up = 0 , down = 0 -- rand = 1 ( 24) Pass 4: obj. 0.81356 --> up = 1 , down = 0 perturbation applied Pass 5: obj. 142.23319 --> up = 9 , down = 133 Pass 6: obj. 0.38833 --> up = 0 , down = 0 -- rand = 2 ( 28) Pass 7: obj. 1.60732 --> up = 1 , down = 1 perturbation applied Pass 8: obj. 161.14390 --> up = 15 , down = 145 Pass 9: obj. 1.14390 --> up = 0 , down = 0 -- rand = 3 ( 27) Pass 10: obj. 0.74592 --> up = 0 , down = 1 Pass 11: obj. 0.31351 --> up = 0 , down = 0 -- rand = 2 ( 19) Pass 12: obj. 1.66058 --> up = 1 , down = 1 perturbation applied Pass 13: obj. 150.50292 --> up = 17 , down = 134 Pass 14: obj. 0.22610 --> up = 0 , down = 0 -- rand = 1 ( 14) Pass 15: obj. 0.76327 --> up = 0 , down = 1 perturbation applied Pass 16: obj. 140.65450 --> up = 21 , down = 120 Pass 17: obj. 0.63005 --> up = 0 , down = 0 -- rand = 3 ( 16) Pass 18: obj. 1.55985 --> up = 0 , down = 1 Pass 19: obj. 0.55985 --> up = 0 , down = 0 -- rand = 3 ( 27) Pass 20: obj. 1.47330 --> up = 0 , down = 2 Pass 21: obj. 0.46833 --> up = 0 , down = 0 -- rand = 1 ( 25) Pass 22: obj. 0.49071 --> No solution found this major pass Before mini branch and bound, 5732 integers at bound fixed and 0 continuous Full problem 1926 rows 5799 columns, reduced to 4 rows 66 columns Mini branch and bound improved solution from -2.4428e+06 to -2.45076e+06 (0.30 seconds) After 0.31 seconds - Feasibility pump exiting - took 0.30 seconds Integer solution of -2.45076e+06 found by feasibility pump after 0 iterations and 0 nodes (0.31 seconds) Full problem 1926 rows 5799 columns, reduced to 2 rows 4 columns Integer solution of -2.45086e+06 found by combine solutions after 0 iterations and 0 nodes (0.55 seconds) At root node, 0 cuts changed objective from -2.45154e+06 to -2.45154e+06 in 1 passes Cut generator 0 (Probing) - 2 row cuts (0 active), 1 column cuts in 0.004 seconds - new frequency is 1 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 After 0 nodes, 1 on tree, -2.45086e+06 best solution, best possible -2.45154e+06 (0.56 seconds) Integer solution of -2.45086e+06 found by rounding after 9 iterations and 5 nodes (0.62 seconds) Full problem 1926 rows 5799 columns, reduced to 4 rows 145 columns Integer solution of -2.45113e+06 found by combine solutions after 12 iterations and 6 nodes (0.75 seconds) Integer solution of -2.45117e+06 found by rounding after 33 iterations and 18 nodes (0.87 seconds) Full problem 1926 rows 5799 columns, reduced to 4 rows 107 columns Integer solution of -2.45132e+06 found by combine solutions after 34 iterations and 19 nodes (0.98 seconds) Integer solution of -2.45135e+06 found by rounding after 137 iterations and 65 nodes (1.37 seconds) Full problem 1926 rows 5799 columns, reduced to 4 rows 119 columns Integer solution of -2.45136e+06 found by combine solutions after 139 iterations and 66 nodes (1.47 seconds) After 100 nodes, 44 on tree, -2.45136e+06 best solution, best possible -2.45143e+06 (1.78 seconds) After 200 nodes, 78 on tree, -2.45136e+06 best solution, best possible -2.45143e+06 (2.27 seconds) After 300 nodes, 114 on tree, -2.45136e+06 best solution, best possible -2.45143e+06 (2.64 seconds) After 400 nodes, 127 on tree, -2.45136e+06 best solution, best possible -2.45143e+06 (2.96 seconds) Strong branching is fixing too many variables, too expensively! After 500 nodes, 157 on tree, -2.45136e+06 best solution, best possible -2.45143e+06 (3.40 seconds) Integer solution of -2.45137e+06 found by rounding after 1193 iterations and 569 nodes (3.66 seconds) Full problem 1926 rows 5799 columns, reduced to 4 rows 115 columns After 600 nodes, 162 on tree, -2.45137e+06 best solution, best possible -2.45142e+06 (3.88 seconds) Integer solution of -2.45137e+06 found by rounding after 1514 iterations and 690 nodes (4.20 seconds) Full problem 1926 rows 5799 columns, reduced to 4 rows 114 columns After 700 nodes, 179 on tree, -2.45137e+06 best solution, best possible -2.45141e+06 (4.36 seconds) After 800 nodes, 201 on tree, -2.45137e+06 best solution, best possible -2.45141e+06 (4.71 seconds) After 900 nodes, 232 on tree, -2.45137e+06 best solution, best possible -2.45141e+06 (5.09 seconds) After 1000 nodes, 247 on tree, -2.45137e+06 best solution, best possible -2.45141e+06 (5.44 seconds) After 1100 nodes, 256 on tree, -2.45137e+06 best solution, best possible -2.45141e+06 (5.73 seconds) After 1200 nodes, 275 on tree, -2.45137e+06 best solution, best possible -2.45141e+06 (6.01 seconds) After 1300 nodes, 288 on tree, -2.45137e+06 best solution, best possible -2.4514e+06 (6.40 seconds) After 1400 nodes, 308 on tree, -2.45137e+06 best solution, best possible -2.4514e+06 (6.66 seconds) Integer solution of -2.45137e+06 found by rounding after 3294 iterations and 1489 nodes (6.88 seconds) Full problem 1926 rows 5799 columns, reduced to 5 rows 114 columns After 1500 nodes, 323 on tree, -2.45137e+06 best solution, best possible -2.4514e+06 (7.00 seconds) Integer solution of -2.45138e+06 found by rounding after 3539 iterations and 1571 nodes (7.15 seconds) Full problem 1926 rows 5799 columns, reduced to 6 rows 117 columns After 1600 nodes, 317 on tree, -2.45138e+06 best solution, best possible -2.4514e+06 (7.32 seconds) After 1700 nodes, 327 on tree, -2.45138e+06 best solution, best possible -2.4514e+06 (7.56 seconds) After 1800 nodes, 332 on tree, -2.45138e+06 best solution, best possible -2.4514e+06 (7.82 seconds) After 1900 nodes, 339 on tree, -2.45138e+06 best solution, best possible -2.4514e+06 (8.10 seconds) After 2000 nodes, 342 on tree, -2.45138e+06 best solution, best possible -2.4514e+06 (8.37 seconds) After 2100 nodes, 343 on tree, -2.45138e+06 best solution, best possible -2.4514e+06 (8.58 seconds) After 2200 nodes, 341 on tree, -2.45138e+06 best solution, best possible -2.4514e+06 (8.80 seconds) After 2300 nodes, 336 on tree, -2.45138e+06 best solution, best possible -2.45139e+06 (8.98 seconds) After 2400 nodes, 332 on tree, -2.45138e+06 best solution, best possible -2.45139e+06 (9.19 seconds) After 2500 nodes, 331 on tree, -2.45138e+06 best solution, best possible -2.45139e+06 (9.47 seconds) After 2600 nodes, 324 on tree, -2.45138e+06 best solution, best possible -2.45139e+06 (9.63 seconds) After 2700 nodes, 309 on tree, -2.45138e+06 best solution, best possible -2.45139e+06 (9.80 seconds) After 2800 nodes, 292 on tree, -2.45138e+06 best solution, best possible -2.45139e+06 (9.97 seconds) After 2900 nodes, 285 on tree, -2.45138e+06 best solution, best possible -2.45139e+06 (10.12 seconds) After 3000 nodes, 278 on tree, -2.45138e+06 best solution, best possible -2.45139e+06 (10.35 seconds) After 3100 nodes, 266 on tree, -2.45138e+06 best solution, best possible -2.45139e+06 (10.51 seconds) After 3200 nodes, 247 on tree, -2.45138e+06 best solution, best possible -2.45139e+06 (10.66 seconds) After 3300 nodes, 229 on tree, -2.45138e+06 best solution, best possible -2.45139e+06 (10.80 seconds) After 3400 nodes, 208 on tree, -2.45138e+06 best solution, best possible -2.45138e+06 (10.95 seconds) After 3500 nodes, 180 on tree, -2.45138e+06 best solution, best possible -2.45138e+06 (11.08 seconds) After 3600 nodes, 150 on tree, -2.45138e+06 best solution, best possible -2.45138e+06 (11.20 seconds) After 3700 nodes, 124 on tree, -2.45138e+06 best solution, best possible -2.45138e+06 (11.32 seconds) After 3800 nodes, 88 on tree, -2.45138e+06 best solution, best possible -2.45138e+06 (11.43 seconds) After 3900 nodes, 49 on tree, -2.45138e+06 best solution, best possible -2.45138e+06 (11.53 seconds) After 4000 nodes, 2 on tree, -2.45138e+06 best solution, best possible -2.45138e+06 (11.60 seconds) Search completed - best objective -2451377, took 10207 iterations and 4004 nodes (11.61 seconds) Strong branching done 3028 times (4898 iterations), fathomed 230 nodes and fixed 366 variables Maximum depth 24, 20309 variables fixed on reduced cost Cuts at root node changed objective from -2.45154e+06 to -2.45154e+06 Probing was tried 562 times and created 5 cuts of which 0 were active after adding rounds of cuts (1.696 seconds) Gomory was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) Knapsack was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) FlowCover was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) Result - Finished objective -2451377 after 4004 nodes and 10207 iterations - took 12.30 seconds (total time 12.36) Total time 12.39 Solved to optimality. Writing solution. Objective: -2.45138e+06 Time: 12.4 s --- Restarting execution --- cap6000.gms(124) 0 Mb --- Reading solution for model m --- cap6000.gms(124) 4 Mb *** Status: Normal completion --- Job cap6000.gms Stop 08/21/08 04:21:29 elapsed 0:00:12.781