--- Job pp08a Start 08/21/08 11:36:29 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 --- pp08a.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/pp08a.gdx --- pp08a.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.008 --- pp08a.gms(123) 4 Mb --- Generating MIP model m --- pp08a.gms(124) 4 Mb --- 137 rows 241 columns 657 non-zeroes --- 64 discrete-columns --- Executing COINCBC: elapsed 0:00:00.013 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 240 columns and 136 rows. 64 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 2748.35 - 0.00 seconds processed model has 133 rows, 234 columns (64 integer) and 468 elements Pass 1: obj. 9.22857 --> up = 8 , down = 0 Pass 2: obj. 1.43690 --> up = 1 , down = 0 Pass 3: obj. 0.43690 --> up = 0 , down = 0 -- rand = 4 ( 25) - solution found of 12150 Before mini branch and bound, 8 integers at bound fixed and 57 continuous Full problem 133 rows 234 columns, reduced to 98 rows 142 columns Mini branch and bound improved solution from 12150 to 8640 (0.11 seconds) Freeing continuous variables gives a solution of 8559.95 Round again with cutoff of 7978.79 Pass 4: obj. 8.26429 --> up = 5 , down = 0 Pass 5: obj. 3.83715 --> up = 0 , down = 0 -- rand = 12 ( 12) Pass 6: obj. 0.64783 --> up = 0 , down = 0 -- rand = 5 ( 11) Pass 7: obj. 1.17552 --> up = 0 , down = 0 -- rand = 9 ( 19) Pass 8: obj. 3.55541 --> up = 0 , down = 3 Pass 9: obj. 1.52900 --> up = 0 , down = 0 -- rand = 11 ( 19) Pass 10: obj. 7.41653 --> up = 0 , down = 8 Pass 11: obj. 2.05523 --> up = 0 , down = 0 -- rand = 15 ( 21) Pass 12: obj. 10.59749 --> up = 0 , down = 11 Pass 13: obj. 2.55165 --> up = 0 , down = 0 -- rand = 14 ( 14) Pass 14: obj. 11.47070 --> up = 0 , down = 14 perturbation applied Pass 15: obj. 6.56467 --> up = 0 , down = 6 Pass 16: obj. 2.71098 --> up = 0 , down = 0 -- rand = 14 ( 14) Pass 17: obj. 10.38737 --> up = 0 , down = 13 Pass 18: obj. 3.11339 --> up = 0 , down = 0 -- rand = 20 ( 23) Pass 19: obj. 16.00403 --> up = 0 , down = 19 Pass 20: obj. 3.34403 --> up = 0 , down = 0 -- rand = 13 ( 13) Pass 21: obj. 8.53737 --> up = 0 , down = 12 Pass 22: obj. 3.00000 --> up = 0 , down = 0 -- rand = 13 ( 22) Pass 23: obj. 9.82237 --> No solution found this major pass Before mini branch and bound, 2 integers at bound fixed and 32 continuous Full problem 133 rows 234 columns, reduced to 110 rows 179 columns Mini branch and bound did not improve solution (0.23 seconds) After 0.23 seconds - Feasibility pump exiting - took 0.23 seconds Integer solution of 8350 found by feasibility pump after 0 iterations and 0 nodes (0.23 seconds) Full problem 133 rows 234 columns, reduced to 80 rows 130 columns Integer solution of 7910 found by combine solutions after 3936 iterations and 0 nodes (4.06 seconds) 69 added rows had average density of 53.942 At root node, 69 cuts changed objective from 2748.35 to 6846.89 in 100 passes Cut generator 0 (Probing) - 66 row cuts (2 active), 28 column cuts in 2.384 seconds - new frequency is 1 Cut generator 1 (Gomory) - 2794 row cuts (30 active), 0 column cuts in 0.204 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.052 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 314 row cuts (21 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.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 255 row cuts (16 active), 0 column cuts in 0.024 seconds - new frequency is -100 After 0 nodes, 1 on tree, 7910 best solution, best possible 6846.89 (4.32 seconds) Integer solution of 7860 found by rounding after 9627 iterations and 241 nodes (11.25 seconds) Full problem 133 rows 234 columns, reduced to 94 rows 156 columns Integer solution of 7610 found by combine solutions after 9634 iterations and 245 nodes (12.69 seconds) After 1000 nodes, 421 on tree, 7610 best solution, best possible 6859.26 (17.02 seconds) After 2000 nodes, 907 on tree, 7610 best solution, best possible 6859.26 (21.85 seconds) Full problem 133 rows 234 columns, reduced to 98 rows 164 columns Integer solution of 7420 found after 56801 iterations and 2398 nodes (25.74 seconds) Full problem 133 rows 234 columns, reduced to 100 rows 168 columns After 3000 nodes, 1116 on tree, 7420 best solution, best possible 6929.26 (30.63 seconds) After 4000 nodes, 1287 on tree, 7420 best solution, best possible 6967.8 (34.19 seconds) Integer solution of 7380 found after 88360 iterations and 4329 nodes (35.47 seconds) Full problem 133 rows 234 columns, reduced to 102 rows 172 columns After 5000 nodes, 1114 on tree, 7380 best solution, best possible 6967.8 (40.04 seconds) Integer solution of 7370 found after 102690 iterations and 5578 nodes (41.90 seconds) Full problem 133 rows 234 columns, reduced to 102 rows 172 columns After 6000 nodes, 994 on tree, 7370 best solution, best possible 7041.47 (45.85 seconds) Integer solution of 7350 found after 113699 iterations and 6727 nodes (48.02 seconds) Full problem 133 rows 234 columns, reduced to 102 rows 172 columns After 7000 nodes, 873 on tree, 7350 best solution, best possible 7187.38 (51.78 seconds) After 8000 nodes, 1129 on tree, 7350 best solution, best possible 7258.9 (57.17 seconds) After 9000 nodes, 1194 on tree, 7350 best solution, best possible 7287.72 (61.78 seconds) After 10000 nodes, 1145 on tree, 7350 best solution, best possible 7307.15 (65.00 seconds) After 11000 nodes, 1014 on tree, 7350 best solution, best possible 7320.66 (67.80 seconds) After 12000 nodes, 804 on tree, 7350 best solution, best possible 7331.65 (70.47 seconds) After 13000 nodes, 488 on tree, 7350 best solution, best possible 7340.4 (72.81 seconds) After 14000 nodes, 110 on tree, 7350 best solution, best possible 7340.53 (74.60 seconds) Search completed - best objective 7350, took 183930 iterations and 14263 nodes (75.23 seconds) Strong branching done 7998 times (112782 iterations), fathomed 219 nodes and fixed 537 variables Maximum depth 43, 20315 variables fixed on reduced cost Cuts at root node changed objective from 2748.35 to 6846.89 Probing was tried 9103 times and created 1206 cuts of which 908 were active after adding rounds of cuts (12.549 seconds) Gomory was tried 6839 times and created 15280 cuts of which 7657 were active after adding rounds of cuts (3.056 seconds) Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.052 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) MixedIntegerRounding2 was tried 100 times and created 314 cuts of which 21 were active after adding rounds of cuts (0.020 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 100 times and created 255 cuts of which 16 were active after adding rounds of cuts (0.024 seconds) Result - Finished objective 7350 after 14263 nodes and 183930 iterations - took 75.23 seconds (total time 75.23) Total time 75.24 Solved to optimality. Writing solution. Objective: 7350 Time: 75.24 s --- Restarting execution --- pp08a.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job pp08a.gms Stop 08/21/08 11:37:44 elapsed 0:01:15.367