--- Job mas284 Start 08/21/08 08:15:58 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 --- mas284.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/mas284.gdx --- mas284.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.026 --- mas284.gms(123) 4 Mb --- Generating MIP model m --- mas284.gms(124) 4 Mb --- 69 rows 152 columns 9,783 non-zeroes --- 150 discrete-columns --- Executing COINCBC: elapsed 0:00:00.048 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 151 columns and 68 rows. 150 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 86195.9 - 0.02 seconds processed model has 68 rows, 148 columns (147 integer) and 9495 elements Full problem 69 rows 148 columns, reduced to 62 rows 3 columns Pass 1: obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 28) - solution found of 104691 - cleaned solution of 104344 Before mini branch and bound, 126 integers at bound fixed and 0 continuous Full problem 68 rows 148 columns, reduced to 68 rows 22 columns Mini branch and bound improved solution from 104344 to 97204.8 (0.14 seconds) Round again with cutoff of 96103.9 Pass 2: obj. 1.83192 --> up = 0 , down = 0 -- rand = 8 ( 19) Pass 3: obj. 2.09855 --> up = 1 , down = 1 Pass 4: obj. 0.13250 --> up = 0 , down = 0 -- rand = 2 ( 12) Pass 5: obj. 0.49284 --> up = 0 , down = 0 -- rand = 2 ( 18) perturbation applied Pass 6: obj. 19.00000 --> up = 0 , down = 19 Pass 7: obj. 0.49284 --> up = 0 , down = 0 -- rand = 2 ( 12) perturbation applied Pass 8: obj. 24.00000 --> up = 0 , down = 23 Pass 9: obj. 1.00000 --> up = 0 , down = 0 -- rand = 4 ( 14) Pass 10: obj. 1.98709 --> up = 2 , down = 0 Pass 11: obj. 0.67874 --> up = 0 , down = 0 -- rand = 3 ( 11) Pass 12: obj. 2.00000 --> up = 0 , down = 2 Pass 13: obj. 0.78353 --> up = 0 , down = 0 -- rand = 3 ( 14) Pass 14: obj. 1.37180 --> up = 1 , down = 0 Pass 15: obj. 0.37180 --> up = 0 , down = 0 -- rand = 3 ( 22) Pass 16: obj. 1.29893 --> up = 0 , down = 1 Pass 17: obj. 0.29893 --> up = 0 , down = 0 -- rand = 2 ( 19) Pass 18: obj. 0.60981 --> up = 0 , down = 0 -- rand = 3 ( 24) Pass 19: obj. 1.36292 --> up = 0 , down = 1 Pass 20: obj. 1.02399 --> up = 0 , down = 1 Pass 21: obj. 0.68162 --> No solution found this major pass Before mini branch and bound, 119 integers at bound fixed and 0 continuous Full problem 68 rows 148 columns, reduced to 68 rows 29 columns Mini branch and bound did not improve solution (0.30 seconds) After 0.30 seconds - Feasibility pump exiting - took 0.30 seconds Integer solution of 97204.8 found by feasibility pump after 0 iterations and 0 nodes (0.30 seconds) Full problem 68 rows 148 columns, reduced to 65 rows 9 columns 9 added rows had average density of 148 At root node, 9 cuts changed objective from 86195.9 to 86323.7 in 69 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 4.192 seconds - new frequency is 10 Cut generator 1 (Gomory) - 1436 row cuts (9 active), 0 column cuts in 0.100 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.008 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) - 0 row cuts (0 active), 0 column cuts in 0.016 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) - 203 row cuts (0 active), 0 column cuts in 0.124 seconds - new frequency is -100 After 0 nodes, 1 on tree, 97204.8 best solution, best possible 86323.7 (5.16 seconds) Full problem 68 rows 148 columns, reduced to 68 rows 16 columns Integer solution of 94393.8 found by combine solutions after 3831 iterations and 131 nodes (7.72 seconds) Integer solution of 93375.1 found after 5393 iterations and 257 nodes (8.42 seconds) Full problem 68 rows 148 columns, reduced to 68 rows 17 columns Integer solution of 93159.6 found by combine solutions after 5409 iterations and 258 nodes (8.57 seconds) Full problem 68 rows 148 columns, reduced to 68 rows 22 columns Integer solution of 91596.6 found after 14567 iterations and 902 nodes (11.00 seconds) Full problem 68 rows 148 columns, reduced to 68 rows 25 columns After 1000 nodes, 326 on tree, 91596.6 best solution, best possible 88631.4 (11.50 seconds) After 2000 nodes, 696 on tree, 91596.6 best solution, best possible 89774.9 (13.94 seconds) After 3000 nodes, 990 on tree, 91596.6 best solution, best possible 90105.6 (15.88 seconds) After 4000 nodes, 1212 on tree, 91596.6 best solution, best possible 90315.3 (17.50 seconds) After 5000 nodes, 1386 on tree, 91596.6 best solution, best possible 90476.4 (19.13 seconds) After 6000 nodes, 1554 on tree, 91596.6 best solution, best possible 90601.1 (20.71 seconds) After 7000 nodes, 1689 on tree, 91596.6 best solution, best possible 90708.4 (22.16 seconds) After 8000 nodes, 1803 on tree, 91596.6 best solution, best possible 90810.5 (23.63 seconds) After 9000 nodes, 1864 on tree, 91596.6 best solution, best possible 90904.6 (25.01 seconds) After 10000 nodes, 1924 on tree, 91596.6 best solution, best possible 90983.3 (25.87 seconds) After 11000 nodes, 1951 on tree, 91596.6 best solution, best possible 91061.7 (26.65 seconds) Full problem 68 rows 148 columns, reduced to 68 rows 28 columns After 12000 nodes, 1659 on tree, 91494.1 best solution, best possible 91130.9 (27.81 seconds) Integer solution of 91405.7 found after 106172 iterations and 12748 nodes (28.54 seconds) Full problem 68 rows 148 columns, reduced to 68 rows 30 columns After 13000 nodes, 1177 on tree, 91405.7 best solution, best possible 91198.3 (28.90 seconds) After 14000 nodes, 873 on tree, 91405.7 best solution, best possible 91198.4 (29.30 seconds) After 15000 nodes, 638 on tree, 91405.7 best solution, best possible 91284.2 (29.93 seconds) After 16000 nodes, 295 on tree, 91405.7 best solution, best possible 91352.6 (30.50 seconds) Search completed - best objective 91405.72368220001, took 117700 iterations and 16698 nodes (30.82 seconds) Strong branching done 7968 times (84560 iterations), fathomed 291 nodes and fixed 761 variables Maximum depth 44, 78933 variables fixed on reduced cost Cuts at root node changed objective from 86195.9 to 86323.7 Probing was tried 1162 times and created 6 cuts of which 1 were active after adding rounds of cuts (9.869 seconds) Gomory was tried 69 times and created 1436 cuts of which 9 were active after adding rounds of cuts (0.100 seconds) Knapsack was tried 69 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) Clique was tried 69 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) MixedIntegerRounding2 was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.016 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 69 times and created 203 cuts of which 0 were active after adding rounds of cuts (0.124 seconds) Result - Finished objective 91405.72368220001 after 16698 nodes and 117700 iterations - took 31.05 seconds (total time 31.07) Total time 31.07 Solved to optimality. Writing solution. Objective: 91405.7 Time: 31.08 s --- Restarting execution --- mas284.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job mas284.gms Stop 08/21/08 08:16:29 elapsed 0:00:31.187