--- Job mas284 Start 08/21/08 22:16:05 GAMS Rev 228 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.011 --- 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.030 GAMS/CoinCbc 2.1 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.10.00, build Jun 21 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 86195.9 - 0.01 seconds processed model has 68 rows, 148 columns (147 integer) and 9495 elements Pass 1: suminf. 0.20998 obj. 104691 iterations 38 Solution found of 104691 Full problem 69 rows 148 columns, reduced to 62 rows 3 columns 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 93597.2 (0.13 seconds) Freeing continuous variables gives a solution of 93597.2 Round again with cutoff of 92857.1 Reduced cost fixing fixed 1 variables on major pass 2 Pass 2: suminf. 2.85373 obj. 92857.1 iterations 36 Pass 3: suminf. 2.92790 obj. 92857.1 iterations 19 Pass 4: suminf. 1.60277 obj. 92857.1 iterations 6 Pass 5: suminf. 0.99031 obj. 92857.1 iterations 7 Pass 6: suminf. 0.55954 obj. 92857.1 iterations 7 Pass 7: suminf. 1.21237 obj. 92857.1 iterations 18 Pass 8: suminf. 0.86046 obj. 92857.1 iterations 12 Pass 9: suminf. 2.44898 obj. 92857.1 iterations 16 Pass 10: suminf. 1.38158 obj. 92857.1 iterations 13 Pass 11: suminf. 1.17684 obj. 92857.1 iterations 3 Pass 12: suminf. 1.79236 obj. 92857.1 iterations 21 Pass 13: suminf. 1.21303 obj. 92857.1 iterations 9 Pass 14: suminf. 1.34293 obj. 92857.1 iterations 8 Pass 15: suminf. 1.00000 obj. 92857.1 iterations 6 Pass 16: suminf. 1.00000 obj. 92857.1 iterations 1 Pass 17: suminf. 1.26265 obj. 92857.1 iterations 13 Pass 18: suminf. 0.89960 obj. 92857.1 iterations 11 Pass 19: suminf. 2.23848 obj. 92857.1 iterations 13 Pass 20: suminf. 1.83290 obj. 92857.1 iterations 8 Pass 21: suminf. 1.85428 obj. 92857.1 iterations 11 Before mini branch and bound, 118 integers at bound fixed and 0 continuous Full problem 68 rows 148 columns, reduced to 68 rows 30 columns Mini branch and bound did not improve solution (0.29 seconds) After 0.29 seconds - Feasibility pump exiting with objective of 1.11022e-16 - took 0.28 seconds Integer solution of 104344 found by feasibility pump after 0 iterations and 0 nodes (0.29 seconds) Full problem 68 rows 148 columns, reduced to 67 rows 8 columns 11 added rows had average density of 148 At root node, 11 cuts changed objective from 86195.9 to 86315.9 in 12 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 1.972 seconds - new frequency is 10 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.004 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.120 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.020 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 203 row cuts (3 active), 0 column cuts in 0.036 seconds - new frequency is -100 After 0 nodes, 1 on tree, 104344 best solution, best possible 86315.9 (2.58 seconds) Full problem 68 rows 148 columns, reduced to 68 rows 13 columns Integer solution of 96105.7 found by combine solutions after 2441 iterations and 126 nodes (5.18 seconds) Full problem 68 rows 148 columns, reduced to 68 rows 17 columns Full problem 68 rows 148 columns, reduced to 68 rows 19 columns Integer solution of 93398.6 found by combine solutions after 3212 iterations and 201 nodes (5.78 seconds) Full problem 68 rows 148 columns, reduced to 68 rows 20 columns Integer solution of 92119.4 found after 5182 iterations and 350 nodes (6.56 seconds) Full problem 68 rows 148 columns, reduced to 68 rows 23 columns After 1000 nodes, 439 on tree, 92119.4 best solution, best possible 89235.6 (8.49 seconds) After 2000 nodes, 868 on tree, 92119.4 best solution, best possible 89764.6 (10.06 seconds) After 3000 nodes, 1210 on tree, 92119.4 best solution, best possible 90056.3 (11.54 seconds) After 4000 nodes, 1507 on tree, 92119.4 best solution, best possible 90248.9 (12.80 seconds) After 5000 nodes, 1773 on tree, 92119.4 best solution, best possible 90388.7 (13.80 seconds) After 6000 nodes, 2028 on tree, 92119.4 best solution, best possible 90515.1 (14.92 seconds) After 7000 nodes, 2244 on tree, 92119.4 best solution, best possible 90606 (15.98 seconds) After 8000 nodes, 2455 on tree, 92119.4 best solution, best possible 90693 (17.00 seconds) After 9000 nodes, 2658 on tree, 92119.4 best solution, best possible 90767.9 (17.98 seconds) After 10000 nodes, 2843 on tree, 92119.4 best solution, best possible 90837.4 (18.84 seconds) After 11000 nodes, 3019 on tree, 92119.4 best solution, best possible 90900.2 (19.58 seconds) After 12000 nodes, 3194 on tree, 92119.4 best solution, best possible 90951.9 (20.33 seconds) Integer solution of 92087.2 found after 117219 iterations and 12314 nodes (20.56 seconds) Full problem 68 rows 148 columns, reduced to 68 rows 27 columns After 13000 nodes, 3319 on tree, 92087.2 best solution, best possible 90999.6 (21.21 seconds) Integer solution of 91727 found after 122442 iterations and 13008 nodes (21.21 seconds) Full problem 68 rows 148 columns, reduced to 68 rows 27 columns After 14000 nodes, 2744 on tree, 91727 best solution, best possible 91038.1 (22.01 seconds) After 15000 nodes, 2826 on tree, 91727 best solution, best possible 91077.5 (22.64 seconds) Integer solution of 91644.2 found after 140474 iterations and 15561 nodes (22.97 seconds) Full problem 68 rows 148 columns, reduced to 68 rows 30 columns After 16000 nodes, 2611 on tree, 91644.2 best solution, best possible 91113.6 (23.36 seconds) After 17000 nodes, 2644 on tree, 91644.2 best solution, best possible 91146.8 (23.93 seconds) Integer solution of 91552.8 found after 150593 iterations and 17013 nodes (23.94 seconds) Full problem 68 rows 148 columns, reduced to 68 rows 32 columns After 18000 nodes, 2285 on tree, 91552.8 best solution, best possible 91176.7 (24.74 seconds) Integer solution of 91405.7 found after 159858 iterations and 18364 nodes (24.98 seconds) Full problem 68 rows 148 columns, reduced to 68 rows 36 columns After 19000 nodes, 1582 on tree, 91405.7 best solution, best possible 91207.1 (25.57 seconds) After 20000 nodes, 1475 on tree, 91405.7 best solution, best possible 91235.1 (26.12 seconds) After 21000 nodes, 1328 on tree, 91405.7 best solution, best possible 91262.2 (26.66 seconds) After 22000 nodes, 1035 on tree, 91405.7 best solution, best possible 91262.2 (26.99 seconds) After 23000 nodes, 892 on tree, 91405.7 best solution, best possible 91303.1 (27.53 seconds) After 24000 nodes, 731 on tree, 91405.7 best solution, best possible 91336.6 (28.05 seconds) After 25000 nodes, 481 on tree, 91405.7 best solution, best possible 91364.6 (28.51 seconds) After 26000 nodes, 100 on tree, 91405.7 best solution, best possible 91365.3 (28.89 seconds) Search completed - best objective 91405.72368220001, took 208853 iterations and 26311 nodes (29.05 seconds) Strong branching done 5492 times (63876 iterations), fathomed 26 nodes and fixed 275 variables Maximum depth 41, 120689 variables fixed on reduced cost Cuts at root node changed objective from 86195.9 to 86315.9 Probing was tried 1590 times and created 40 cuts of which 10 were active after adding rounds of cuts (5.336 seconds) Gomory was tried 12 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) Knapsack was tried 12 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) Clique was tried 12 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) MixedIntegerRounding2 was tried 12 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.120 seconds) FlowCover was tried 12 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.020 seconds) TwoMirCuts was tried 12 times and created 203 cuts of which 3 were active after adding rounds of cuts (0.036 seconds) Result - Finished objective 91405.72368220001 after 26311 nodes and 208853 iterations - took 29.23 seconds (total time 29.24) Total time 29.24 Solved to optimality. MIP solution: 91405.72368 (26311 nodes, 29.24 seconds) Best possible: 91405.72368 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- mas284.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job mas284.gms Stop 08/21/08 22:16:34 elapsed 0:00:29.359