--- Job p2756 Start 08/21/08 11:33:34 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 --- p2756.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/p2756.gdx --- p2756.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.025 --- p2756.gms(123) 4 Mb --- Generating MIP model m --- p2756.gms(124) 5 Mb --- 756 rows 2,757 columns 11,104 non-zeroes --- 2,756 discrete-columns --- p2756.gms(124) 5 Mb --- Executing COINCBC: elapsed 0:00:00.067 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 2756 columns and 755 rows. 2756 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 2688.75 - 0.01 seconds 8 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 8 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 705 rows, 2607 columns (2607 integer) and 8113 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: obj. 1.88770 --> up = 0 , down = 0 -- rand = 19 ( 19) Pass 2: obj. 2.36163 --> up = 2 , down = 0 Pass 3: obj. 0.73992 --> up = 0 , down = 0 -- rand = 5 ( 14) Pass 4: obj. 0.81873 --> up = 1 , down = 0 Pass 5: obj. 0.19992 --> up = 0 , down = 0 -- rand = 4 ( 29) Pass 6: obj. 1.21209 --> up = 1 , down = 0 Pass 7: obj. 0.59328 --> up = 0 , down = 0 -- rand = 4 ( 18) perturbation applied Pass 8: obj. 34.97059 --> up = 0 , down = 28 Pass 9: obj. 7.00931 --> up = 0 , down = 0 -- rand = 12 ( 12) Pass 10: obj. 4.15444 --> up = 0 , down = 0 -- rand = 11 ( 11) Pass 11: obj. 2.44531 --> up = 0 , down = 0 -- rand = 24 ( 24) Pass 12: obj. 1.39374 --> up = 1 , down = 0 Pass 13: obj. 0.77493 --> up = 0 , down = 0 -- rand = 16 ( 16) Pass 14: obj. 0.88874 --> up = 1 , down = 0 Pass 15: obj. 0.26993 --> up = 0 , down = 0 -- rand = 26 ( 27) Pass 16: obj. 1.87281 --> up = 1 , down = 0 Pass 17: obj. 1.25400 --> up = 0 , down = 0 -- rand = 21 ( 21) Pass 18: obj. 0.84662 --> up = 1 , down = 0 Pass 19: obj. 0.22782 --> up = 0 , down = 0 -- rand = 24 ( 29) Pass 20: obj. 1.88582 --> No solution found this major pass Before mini branch and bound, 2198 integers at bound fixed and 0 continuous Mini branch and bound did not improve solution (0.08 seconds) After 0.08 seconds - Feasibility pump exiting - took 0.07 seconds 201 added rows had average density of 20.4428 At root node, 201 cuts changed objective from 2701.14 to 3116.4 in 15 passes Cut generator 0 (Probing) - 113 row cuts (15 active), 3 column cuts in 0.108 seconds - new frequency is 1 Cut generator 1 (Gomory) - 174 row cuts (21 active), 0 column cuts in 0.044 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 416 row cuts (40 active), 0 column cuts in 0.032 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 69 row cuts (16 active), 0 column cuts in 0.052 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) - 303 row cuts (109 active), 0 column cuts in 0.044 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 3116.4 (0.53 seconds) Integer solution of 3167 found by rounding after 665 iterations and 7 nodes (0.86 seconds) Integer solution of 3156 found by rounding after 701 iterations and 8 nodes (0.90 seconds) Integer solution of 3143 found by combine solutions after 704 iterations and 9 nodes (0.96 seconds) Integer solution of 3136 found by combine solutions after 713 iterations and 10 nodes (1.01 seconds) Integer solution of 3128 found by rounding after 935 iterations and 20 nodes (1.34 seconds) Full problem 705 rows 2607 columns, reduced to 43 rows 92 columns Integer solution of 3127 found by rounding after 953 iterations and 21 nodes (1.43 seconds) Full problem 705 rows 2607 columns, reduced to 46 rows 101 columns Integer solution of 3125 found by rounding after 1035 iterations and 31 nodes (1.62 seconds) Search completed - best objective 3124, took 1061 iterations and 33 nodes (1.70 seconds) Strong branching done 356 times (2026 iterations), fathomed 3 nodes and fixed 20 variables Maximum depth 9, 11182 variables fixed on reduced cost Cuts at root node changed objective from 2701.14 to 3116.4 Probing was tried 42 times and created 153 cuts of which 28 were active after adding rounds of cuts (0.188 seconds) Gomory was tried 40 times and created 196 cuts of which 31 were active after adding rounds of cuts (0.064 seconds) Knapsack was tried 42 times and created 524 cuts of which 54 were active after adding rounds of cuts (0.076 seconds) Clique was tried 15 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 15 times and created 69 cuts of which 16 were active after adding rounds of cuts (0.052 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 15 times and created 303 cuts of which 109 were active after adding rounds of cuts (0.044 seconds) Result - Finished objective 3124 after 33 nodes and 1061 iterations - took 2.40 seconds (total time 2.42) Total time 2.43 Solved to optimality. Writing solution. Objective: 3124 Time: 2.43 s --- Restarting execution --- p2756.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job p2756.gms Stop 08/21/08 11:33:36 elapsed 0:00:02.556