--- Job air05 Start 08/21/08 01:54:37 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 --- air05.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/air05.gdx --- air05.gms(148) 5 Mb --- Starting execution: elapsed 0:00:00.080 --- air05.gms(123) 5 Mb --- Generating MIP model m --- air05.gms(124) 8 Mb --- 427 rows 7,196 columns 59,317 non-zeroes --- 7,195 discrete-columns --- air05.gms(124) 8 Mb --- Executing COINCBC: elapsed 0:00:00.221 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 7195 columns and 426 rows. 7195 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 25877.6 - 0.34 seconds 73 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 752 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 9 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 349 rows, 6434 columns (6434 integer) and 40530 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: obj. 25.03030 --> up = 15 , down = 0 Pass 2: obj. 12.00000 --> up = 9 , down = 1 Pass 3: obj. 2.00000 --> up = 2 , down = 0 - solution found of 30680 Before mini branch and bound, 6126 integers at bound fixed and 0 continuous Full problem 349 rows 6434 columns, reduced to 224 rows 285 columns Mini branch and bound improved solution from 30680 to 29216 (2.69 seconds) Round again with cutoff of 28882.2 Pass 4: obj. 25.09051 --> up = 15 , down = 0 Pass 5: obj. 13.38240 --> up = 4 , down = 0 Pass 6: obj. 11.52333 --> up = 2 , down = 1 Pass 7: obj. 10.90885 --> up = 1 , down = 0 Pass 8: obj. 10.53153 --> up = 1 , down = 1 Pass 9: obj. 9.95893 --> up = 1 , down = 1 Pass 10: obj. 8.89505 --> up = 1 , down = 0 Pass 11: obj. 7.98746 --> up = 3 , down = 1 Pass 12: obj. 6.00000 --> up = 0 , down = 1 Pass 13: obj. 5.50000 --> up = 5 , down = 2 Pass 14: obj. 2.50000 --> up = 0 , down = 1 Pass 15: obj. 2.50000 --> up = 0 , down = 0 -- rand = 5 ( 18) Pass 16: obj. 2.50000 --> up = 0 , down = 1 Pass 17: obj. 2.50000 --> up = 0 , down = 0 -- rand = 5 ( 23) perturbation applied Pass 18: obj. 221.20203 --> up = 4 , down = 215 Pass 19: obj. 2.50000 --> up = 0 , down = 0 -- rand = 5 ( 17) Pass 20: obj. 2.50000 --> up = 0 , down = 1 Pass 21: obj. 2.50000 --> up = 0 , down = 0 -- rand = 5 ( 14) Pass 22: obj. 2.50000 --> up = 0 , down = 1 perturbation applied Pass 23: obj. 244.36814 --> No solution found this major pass Before mini branch and bound, 3791 integers at bound fixed and 0 continuous Full problem 349 rows 6434 columns, reduced to 321 rows 2443 columns Mini branch and bound did not improve solution (20.31 seconds) After 20.31 seconds - Feasibility pump exiting - took 20.30 seconds Full problem 349 rows 6434 columns, reduced to 165 rows 1650 columns Integer solution of 26677 found by greedy equality after 0 iterations and 0 nodes (22.80 seconds) 24 added rows had average density of 6.41667 At root node, 24 cuts changed objective from 25877.6 to 25952.8 in 11 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.116 seconds - new frequency is 10 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.028 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.032 seconds - new frequency is -100 Cut generator 3 (Clique) - 125 row cuts (22 active), 0 column cuts in 0.020 seconds - new frequency is 1 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 0 row cuts (0 active), 0 column cuts in 0.060 seconds - new frequency is -100 After 0 nodes, 1 on tree, 26677 best solution, best possible 25952.8 (24.08 seconds) Strong branching is fixing too many variables, too expensively! After 100 nodes, 28 on tree, 26677 best solution, best possible 26048.3 (66.88 seconds) After 200 nodes, 23 on tree, 26677 best solution, best possible 26048.3 (86.41 seconds) After 300 nodes, 59 on tree, 26635 best solution, best possible 26048.3 (121.00 seconds) After 400 nodes, 90 on tree, 26635 best solution, best possible 26048.3 (147.14 seconds) After 500 nodes, 122 on tree, 26635 best solution, best possible 26048.3 (170.39 seconds) After 600 nodes, 156 on tree, 26635 best solution, best possible 26048.3 (197.69 seconds) After 700 nodes, 194 on tree, 26635 best solution, best possible 26048.3 (225.84 seconds) After 800 nodes, 209 on tree, 26635 best solution, best possible 26048.3 (243.58 seconds) After 900 nodes, 215 on tree, 26635 best solution, best possible 26048.3 (257.16 seconds) After 1000 nodes, 225 on tree, 26635 best solution, best possible 26048.3 (269.59 seconds) After 1100 nodes, 239 on tree, 26635 best solution, best possible 26048.3 (283.54 seconds) After 1200 nodes, 264 on tree, 26635 best solution, best possible 26048.3 (303.99 seconds) Integer solution of 26470 found after 157836 iterations and 1278 nodes (317.88 seconds) Full problem 349 rows 6434 columns, reduced to 0 rows 0 columns Integer solution of 26458 found by combine solutions after 157840 iterations and 1279 nodes (318.06 seconds) After 1300 nodes, 212 on tree, 26458 best solution, best possible 26054.3 (323.01 seconds) After 1400 nodes, 225 on tree, 26458 best solution, best possible 26122.3 (340.80 seconds) After 1500 nodes, 231 on tree, 26458 best solution, best possible 26130 (351.05 seconds) Full problem 349 rows 6434 columns, reduced to 1 rows 2 columns Integer solution of 26402 found by combine solutions after 184956 iterations and 1536 nodes (353.89 seconds) Integer solution of 26374 found after 188924 iterations and 1576 nodes (359.01 seconds) Full problem 349 rows 6434 columns, reduced to 75 rows 67 columns After 1600 nodes, 144 on tree, 26374 best solution, best possible 26194.7 (362.61 seconds) After 1700 nodes, 152 on tree, 26374 best solution, best possible 26237.8 (375.88 seconds) After 1800 nodes, 154 on tree, 26374 best solution, best possible 26267.6 (382.85 seconds) After 1900 nodes, 154 on tree, 26374 best solution, best possible 26283.2 (388.75 seconds) After 2000 nodes, 153 on tree, 26374 best solution, best possible 26293.8 (393.59 seconds) After 2100 nodes, 148 on tree, 26374 best solution, best possible 26304.1 (397.66 seconds) After 2200 nodes, 145 on tree, 26374 best solution, best possible 26313.5 (400.56 seconds) After 2300 nodes, 136 on tree, 26374 best solution, best possible 26319.1 (403.60 seconds) After 2400 nodes, 126 on tree, 26374 best solution, best possible 26324.7 (406.06 seconds) After 2500 nodes, 110 on tree, 26374 best solution, best possible 26330.8 (408.69 seconds) After 2600 nodes, 88 on tree, 26374 best solution, best possible 26337.9 (411.85 seconds) After 2700 nodes, 57 on tree, 26374 best solution, best possible 26348.9 (414.26 seconds) After 2800 nodes, 16 on tree, 26374 best solution, best possible 26361.9 (415.44 seconds) Search completed - best objective 26374, took 239167 iterations and 2836 nodes (415.85 seconds) Strong branching done 19888 times (1151069 iterations), fathomed 171 nodes and fixed 2206 variables Maximum depth 76, 970541 variables fixed on reduced cost Cuts at root node changed objective from 25877.6 to 25952.8 Probing was tried 195 times and created 0 cuts of which 25 were active after adding rounds of cuts (1.228 seconds) Gomory was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.028 seconds) Knapsack was tried 11 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.032 seconds) Clique was tried 441 times and created 5048 cuts of which 1277 were active after adding rounds of cuts (0.816 seconds) MixedIntegerRounding2 was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.060 seconds) Result - Finished objective 26374 after 2836 nodes and 239167 iterations - took 422.10 seconds (total time 422.45) Total time 422.49 Solved to optimality. Writing solution. Objective: 26374 Time: 422.5 s --- Restarting execution --- air05.gms(124) 0 Mb --- Reading solution for model m --- air05.gms(124) 4 Mb *** Status: Normal completion --- Job air05.gms Stop 08/21/08 02:01:40 elapsed 0:07:03.461