Hi, I managed to compile and install CBC in Mac OS X properly.
It seems that CBC has undocumented -max option. See this logs below. The MIP problem was solved. 17.8 minutes to get the optiminal solution. Thsnks. Noli. ################## Nolis-MacBook-Pro:Case_Studies nsicad$ cbc TimberHarvestModel_0025p_mps.mps -max -solve -solution Welcome to the CBC MILP Solver Version: 2.7.7 Build Date: Nov 19 2012 command line - cbc TimberHarvestModel_0025p_mps.mps -max -solve -solution (default strategy 1) At line 8 NAME TimberHa At line 9 ROWS At line 474 COLUMNS At line 1252 RHS At line 1477 BOUNDS At line 1727 ENDATA Problem TimberHa has 463 rows, 255 columns and 1181 elements Coin0008I TimberHa read with 0 errors Continuous objective value is 350195 - 0.01 seconds Cgl0003I 0 fixed, 0 tightened bounds, 116 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 16 strengthened rows, 0 substitutions Cgl0004I processed model has 258 rows, 232 columns (228 integer) and 1044 elements Cbc0038I Pass 1: suminf. 1.42641 (6) obj. -338645 iterations 65 Cbc0038I Pass 2: suminf. 0.82768 (4) obj. -320258 iterations 11 Cbc0038I Pass 3: suminf. 0.82768 (4) obj. -320258 iterations 0 Cbc0038I Pass 4: suminf. 4.39163 (13) obj. -298649 iterations 64 Cbc0038I Pass 5: suminf. 1.07166 (5) obj. -300682 iterations 44 Cbc0038I Pass 6: suminf. 1.07166 (5) obj. -300682 iterations 0 Cbc0038I Pass 7: suminf. 2.41432 (9) obj. -306109 iterations 79 Cbc0038I Pass 8: suminf. 1.43824 (5) obj. -307654 iterations 35 Cbc0038I Pass 9: suminf. 1.43824 (5) obj. -307654 iterations 0 Cbc0038I Pass 10: suminf. 3.44537 (10) obj. -268085 iterations 68 Cbc0038I Pass 11: suminf. 1.45640 (6) obj. -257898 iterations 30 Cbc0038I Pass 12: suminf. 0.71466 (4) obj. -240348 iterations 12 Cbc0038I Pass 13: suminf. 0.71466 (4) obj. -240348 iterations 0 Cbc0038I Pass 14: suminf. 2.63764 (10) obj. -259140 iterations 64 Cbc0038I Pass 15: suminf. 1.01755 (5) obj. -261736 iterations 28 Cbc0038I Pass 16: suminf. 1.01755 (5) obj. -261736 iterations 0 Cbc0038I Pass 17: suminf. 3.45377 (12) obj. -255854 iterations 54 Cbc0038I Pass 18: suminf. 1.55837 (5) obj. -251959 iterations 27 Cbc0038I Pass 19: suminf. 1.55837 (5) obj. -251959 iterations 0 Cbc0038I Pass 20: suminf. 2.85175 (13) obj. -245557 iterations 63 Cbc0038I Pass 21: suminf. 0.73747 (6) obj. -247158 iterations 31 Cbc0038I Pass 22: suminf. 0.73747 (6) obj. -247158 iterations 0 Cbc0038I Pass 23: suminf. 2.86130 (11) obj. -251553 iterations 45 Cbc0038I Pass 24: suminf. 0.87944 (4) obj. -250146 iterations 28 Cbc0038I Pass 25: suminf. 0.87944 (4) obj. -250146 iterations 0 Cbc0038I Pass 26: suminf. 5.73582 (18) obj. -243947 iterations 70 Cbc0038I Pass 27: suminf. 1.52846 (8) obj. -252208 iterations 31 Cbc0038I Pass 28: suminf. 1.52846 (8) obj. -252208 iterations 0 Cbc0038I Pass 29: suminf. 2.16661 (6) obj. -282709 iterations 54 Cbc0038I Pass 30: suminf. 1.20528 (5) obj. -262737 iterations 30 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 80 integers at bound fixed and 0 continuous Cbc0038I Full problem 258 rows 232 columns, reduced to 150 rows 152 columns - too large Cbc0038I Mini branch and bound did not improve solution (0.15 seconds) Cbc0038I After 0.17 seconds - Feasibility pump exiting - took 0.11 seconds Cbc0031I 15 added rows had average density of 196.2 Cbc0013I At root node, 15 cuts changed objective from -350191.79 to -348816.26 in 100 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.331 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 453 row cuts average 202.3 elements, 0 column cuts (15 active) in 0.496 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.113 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.017 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.041 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.085 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 82 row cuts average 186.8 elements, 0 column cuts (0 active) in 0.117 seconds - new frequency is -100 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible -348816.26 (2.12 seconds) Cbc0016I Integer solution of -304949.14 found by strong branching after 30930 iterations and 504 nodes (16.52 seconds) Cbc0038I Full problem 258 rows 232 columns, reduced to 23 rows 24 columns Cbc0038I Full problem 258 rows 232 columns, reduced to 31 rows 36 columns Cbc0038I Full problem 258 rows 232 columns, reduced to 43 rows 49 columns Cbc0012I Integer solution of -327616.05 found by rounding after 60810 iterations and 877 nodes (98.19 seconds) Cbc0038I Full problem 258 rows 232 columns, reduced to 14 rows 36 columns Cbc0016I Integer solution of -328752.84 found by strong branching after 62122 iterations and 892 nodes (98.28 seconds) Cbc0038I Full problem 258 rows 232 columns, reduced to 5 rows 4 columns Cbc0038I Full problem 258 rows 232 columns, reduced to 17 rows 16 columns Cbc0016I Integer solution of -330145.19 found by strong branching after 71078 iterations and 985 nodes (98.84 seconds) Cbc0038I Full problem 258 rows 232 columns, reduced to 26 rows 34 columns Cbc0016I Integer solution of -330518.52 found by strong branching after 72392 iterations and 999 nodes (98.92 seconds) Cbc0010I After 1000 nodes, 227 on tree, -330518.52 best solution, best possible -348816.26 (98.93 seconds) Cbc0016I Integer solution of -332105.19 found by strong branching after 72394 iterations and 1001 nodes (98.93 seconds) Cbc0038I Full problem 258 rows 232 columns, reduced to 34 rows 41 columns Cbc0038I Full problem 258 rows 232 columns, reduced to 26 rows 26 columns Cbc0038I Full problem 258 rows 232 columns, reduced to 48 rows 50 columns Cbc0038I Full problem 258 rows 232 columns, reduced to 50 rows 51 columns Cbc0038I Full problem 258 rows 232 columns, reduced to 49 rows 50 columns Cbc0038I Full problem 258 rows 232 columns, reduced to 48 rows 47 columns Cbc0038I Full problem 258 rows 232 columns, reduced to 51 rows 52 columns Cbc0010I After 2000 nodes, 358 on tree, -332105.19 best solution, best possible -348816.26 (107.39 seconds) Cbc0016I Integer solution of -332133.21 found by strong branching after 193719 iterations and 2110 nodes (108.45 seconds) Cbc0038I Full problem 258 rows 232 columns, reduced to 56 rows 70 columns Cbc0010I After 3000 nodes, 425 on tree, -332133.21 best solution, best possible -348816.26 (115.06 seconds) Cbc0038I Full problem 258 rows 232 columns, reduced to 28 rows 30 columns Cbc0016I Integer solution of -333403.33 found by strong branching after 315584 iterations and 3239 nodes (116.97 seconds) Cbc0038I Full problem 258 rows 232 columns, reduced to 59 rows 73 columns Cbc0038I Full problem 258 rows 232 columns, reduced to 26 rows 30 columns Cbc0004I Integer solution of -335404.81 found after 355511 iterations and 3666 nodes (119.85 seconds) Cbc0038I Full problem 258 rows 232 columns, reduced to 64 rows 78 columns Cbc0016I Integer solution of -335513.46 found by strong branching after 362362 iterations and 3744 nodes (120.59 seconds) Cbc0038I Full problem 258 rows 232 columns, reduced to 64 rows 78 columns Cbc0016I Integer solution of -335988.52 found by strong branching after 367960 iterations and 3822 nodes (121.26 seconds) Cbc0038I Full problem 258 rows 232 columns, reduced to 65 rows 79 columns Cbc0012I Integer solution of -336451.11 found by combine solutions after 368102 iterations and 3824 nodes (121.56 seconds) Cbc0010I After 4000 nodes, 237 on tree, -336451.11 best solution, best possible -348816.26 (122.48 seconds) Cbc0038I Full problem 258 rows 232 columns, reduced to 41 rows 45 columns Cbc0016I Integer solution of -336976.54 found by strong branching after 478812 iterations and 4876 nodes (129.15 seconds) Cbc0038I Full problem 258 rows 232 columns, reduced to 77 rows 91 columns Cbc0010I After 5000 nodes, 280 on tree, -336976.54 best solution, best possible -348816.26 (130.41 seconds) Cbc0016I Integer solution of -337926.67 found by strong branching after 523716 iterations and 5344 nodes (132.50 seconds) Cbc0038I Full problem 258 rows 232 columns, reduced to 84 rows 97 columns Cbc0038I Full problem 258 rows 232 columns, reduced to 31 rows 31 columns Cbc0010I After 6000 nodes, 343 on tree, -337926.67 best solution, best possible -348816.26 (138.93 seconds) Cbc0038I Full problem 258 rows 232 columns, reduced to 44 rows 49 columns Cbc0010I After 7000 nodes, 486 on tree, -337926.67 best solution, best possible -348816.26 (147.49 seconds) Cbc0016I Integer solution of -338411.48 found by strong branching after 737545 iterations and 7100 nodes (148.16 seconds) Cbc0038I Full problem 258 rows 232 columns, reduced to 88 rows 100 columns Cbc0012I Integer solution of -338643.83 found by rounding after 742085 iterations and 7139 nodes (148.89 seconds) Cbc0038I Full problem 258 rows 232 columns, reduced to 92 rows 105 columns Cbc0038I Full problem 258 rows 232 columns, reduced to 49 rows 47 columns Cbc0038I Full problem 258 rows 232 columns, reduced to 40 rows 41 columns . . . Cbc0010I After 97000 nodes, 3352 on tree, -345556.67 best solution, best possible -345889.87 (1040.46 seconds) Cbc0010I After 98000 nodes, 2895 on tree, -345556.67 best solution, best possible -345889.87 (1044.07 seconds) Cbc0010I After 99000 nodes, 2483 on tree, -345556.67 best solution, best possible -345853.57 (1049.56 seconds) Cbc0010I After 100000 nodes, 2056 on tree, -345556.67 best solution, best possible -345814.78 (1054.69 seconds) Cbc0010I After 101000 nodes, 1595 on tree, -345556.67 best solution, best possible -345770.32 (1059.26 seconds) Cbc0010I After 102000 nodes, 1105 on tree, -345556.67 best solution, best possible -345770.32 (1061.59 seconds) Cbc0010I After 103000 nodes, 621 on tree, -345556.67 best solution, best possible -345698.49 (1065.26 seconds) Cbc0010I After 104000 nodes, 123 on tree, -345556.67 best solution, best possible -345591.85 (1067.57 seconds) Cbc0001I Search completed - best objective -345556.6666668299, took 14627711 iterations and 532807 nodes (1068.00 seconds) Cbc0032I Strong branching done 1148280 times (6925301 iterations), fathomed 35748 nodes and fixed 51466 variables Cbc0041I Maximum depth 49, 992812 variables fixed on reduced cost (428562 nodes in complete fathoming taking 2951533 iterations) Cuts at root node changed objective from -350192 to -348816 Probing was tried 95711 times and created 19467 cuts of which 1385 were active after adding rounds of cuts (7.126 seconds) Gomory was tried 100 times and created 453 cuts of which 15 were active after adding rounds of cuts (0.496 seconds) Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.113 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.017 seconds) MixedIntegerRounding2 was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.041 seconds) FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.085 seconds) TwoMirCuts was tried 100 times and created 82 cuts of which 0 were active after adding rounds of cuts (0.117 seconds) Result - Optimal solution found Objective value: 345556.66666683 Enumerated nodes: 532807 Total iterations: 14627711 Time (CPU seconds): 1068.01 Time (Wallclock seconds): 1072.15 Current default (if $ as parameter) for solution is stdout Total time (CPU seconds): 1068.01 (Wallclock seconds): 1072.15 _______________________________________________ Help-glpk mailing list [email protected] https://lists.gnu.org/mailman/listinfo/help-glpk
