Coin Cbc and Clp Solver version 2.20.00, build Aug 5 2008 command line - cbc done/prod1.mps At line 1 NAME GAMSMOD At line 7 ROWS At line 217 COLUMNS At line 5571 RHS At line 5779 BOUNDS At line 6030 ENDATA Problem GAMSMOD has 208 rows, 250 columns and 5350 elements Coin0008I GAMSMOD read with 0 errors Continuous objective value is -100 - 0.01 seconds Optimal - objective value -100 Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 100 substitutions Cgl0004I processed model has 107 rows, 149 columns (149 integer) and 5049 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Cbc0038I Pass 1: suminf. 12.81070 (51) obj. -86.1161 iterations 18 Cbc0038I Pass 2: suminf. 11.84728 (49) obj. -85.1527 iterations 2 Cbc0038I Pass 3: suminf. 6.06666 (35) obj. -76.9333 iterations 16 Cbc0038I Pass 4: suminf. 0.85982 (14) obj. -61.1402 iterations 27 Cbc0038I Pass 5: suminf. 0.00093 (1) obj. -48.9991 iterations 18 Cbc0038I Pass 6: suminf. 0.00093 (1) obj. -48.9991 iterations 0 Cbc0038I Pass 7: suminf. 5.84535 (21) obj. -53.5072 iterations 38 Cbc0038I Pass 8: suminf. 3.57867 (19) obj. -53.4213 iterations 11 Cbc0038I Solution found of -38 Cbc0038I Before mini branch and bound, 72 integers at bound fixed and 0 continuous Cbc0038I Full problem 107 rows 149 columns, reduced to 82 rows 73 columns Cbc0038I Mini branch and bound improved solution from -38 to -48 (0.09 seconds) Cbc0038I Round again with cutoff of -53 Cbc0038I Pass 9: suminf. 12.81070 (51) obj. -86.1161 iterations 18 Cbc0038I Pass 10: suminf. 11.84728 (49) obj. -85.1527 iterations 2 Cbc0038I Pass 11: suminf. 7.12380 (38) obj. -78.8762 iterations 13 Cbc0038I Pass 12: suminf. 0.37926 (9) obj. -56.6207 iterations 34 Cbc0038I Pass 13: suminf. 0.35694 (6) obj. -53 iterations 9 Cbc0038I Pass 14: suminf. 0.35694 (6) obj. -53 iterations 3 Cbc0038I Pass 15: suminf. 0.38854 (6) obj. -53 iterations 4 Cbc0038I Pass 16: suminf. 0.38854 (6) obj. -53 iterations 2 Cbc0038I Pass 17: suminf. 0.35694 (6) obj. -53 iterations 4 Cbc0038I Pass 18: suminf. 6.32218 (26) obj. -53 iterations 59 Cbc0038I Pass 19: suminf. 5.98321 (22) obj. -53 iterations 6 Cbc0038I Pass 20: suminf. 5.86473 (21) obj. -53 iterations 1 Cbc0038I Pass 21: suminf. 5.86473 (21) obj. -53 iterations 0 Cbc0038I Pass 22: suminf. 5.51494 (21) obj. -53 iterations 5 Cbc0038I Pass 23: suminf. 5.51494 (21) obj. -53 iterations 3 Cbc0038I Pass 24: suminf. 5.86473 (21) obj. -53 iterations 5 Cbc0038I Pass 25: suminf. 6.81808 (25) obj. -53 iterations 35 Cbc0038I Pass 26: suminf. 5.67443 (22) obj. -53 iterations 11 Cbc0038I Pass 27: suminf. 5.72142 (22) obj. -53 iterations 3 Cbc0038I Pass 28: suminf. 7.40164 (30) obj. -53 iterations 34 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 51 integers at bound fixed and 0 continuous Cbc0038I Full problem 107 rows 149 columns, reduced to 94 rows 92 columns Cbc0038I Mini branch and bound did not improve solution (0.22 seconds) Cbc0038I After 0.22 seconds - Feasibility pump exiting with objective of -48 - took 0.21 seconds Cbc0012I Integer solution of -48 found by feasibility pump after 0 iterations and 0 nodes (0.22 seconds) Cbc0038I Full problem 107 rows 149 columns, reduced to 0 rows 0 columns Cbc0031I 52 added rows had average density of 57.3077 Cbc0013I At root node, 52 cuts changed objective from -86.8082 to -82.5063 in 100 passes Cbc0014I Cut generator 0 (Probing) - 172 row cuts, 0 column cuts (49 active) in 7.700 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 6163 row cuts, 0 column cuts (3 active) in 0.260 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 5238 row cuts, 0 column cuts (0 active) in 0.368 seconds - new frequency is 1 Cbc0014I Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.012 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 255 row cuts, 0 column cuts (0 active) in 0.388 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.032 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 999 row cuts, 0 column cuts (0 active) in 0.092 seconds - new frequency is -100 Optimal - objective value -74.8747 Optimal - objective value -74.8747 Cbc0010I After 0 nodes, 1 on tree, -48 best solution, best possible -74.8747 (10.13 seconds) Cbc0016I Integer solution of -52 found by strong branching after 6525 iterations and 12 nodes (11.29 seconds) Cbc3008W Strong branching is fixing too many variables, too expensively! Cbc0038I Full problem 107 rows 149 columns, reduced to 26 rows 33 columns Cbc0012I Integer solution of -53 found by combine solutions after 6838 iterations and 14 nodes (11.60 seconds) Cbc0016I Integer solution of -55 found by strong branching after 18045 iterations and 300 nodes (19.84 seconds) Cbc0038I Full problem 107 rows 149 columns, reduced to 52 rows 63 columns Cbc0004I Integer solution of -56 found after 18221 iterations and 309 nodes (20.32 seconds) Cbc0038I Full problem 107 rows 149 columns, reduced to 56 rows 69 columns Cbc0010I After 1000 nodes, 206 on tree, -56 best solution, best possible -66.3845 (29.90 seconds) Cbc0010I After 2000 nodes, 369 on tree, -56 best solution, best possible -64.259 (40.30 seconds) Cbc0010I After 3000 nodes, 494 on tree, -56 best solution, best possible -64.259 (49.46 seconds) Cbc0010I After 4000 nodes, 614 on tree, -56 best solution, best possible -64.2408 (58.53 seconds) Cbc0010I After 5000 nodes, 678 on tree, -56 best solution, best possible -64.2408 (67.20 seconds) Cbc0010I After 6000 nodes, 780 on tree, -56 best solution, best possible -64.2408 (75.70 seconds) Cbc0010I After 7000 nodes, 829 on tree, -56 best solution, best possible -63.4903 (83.11 seconds) Cbc0010I After 8000 nodes, 865 on tree, -56 best solution, best possible -63.4903 (90.05 seconds) Cbc0010I After 9000 nodes, 913 on tree, -56 best solution, best possible -63.4903 (98.29 seconds) Cbc0010I After 10000 nodes, 938 on tree, -56 best solution, best possible -63.4903 (105.67 seconds) Cbc0010I After 11000 nodes, 980 on tree, -56 best solution, best possible -63.4903 (113.76 seconds) Cbc0010I After 12000 nodes, 1178 on tree, -56 best solution, best possible -59.5634 (127.92 seconds) Cbc0010I After 13000 nodes, 1376 on tree, -56 best solution, best possible -58.951 (140.30 seconds) Cbc0010I After 14000 nodes, 1433 on tree, -56 best solution, best possible -58.951 (147.93 seconds) Cbc0010I After 15000 nodes, 1693 on tree, -56 best solution, best possible -58.6289 (161.63 seconds) Cbc0010I After 16000 nodes, 1916 on tree, -56 best solution, best possible -58.3888 (172.83 seconds) Cbc0010I After 17000 nodes, 2011 on tree, -56 best solution, best possible -58.0911 (180.35 seconds) Cbc0010I After 18000 nodes, 1890 on tree, -56 best solution, best possible -58.0905 (185.08 seconds) Cbc0010I After 19000 nodes, 2100 on tree, -56 best solution, best possible -57.9331 (196.19 seconds) Cbc0010I After 20000 nodes, 2259 on tree, -56 best solution, best possible -57.8581 (205.60 seconds) Cbc0010I After 21000 nodes, 2267 on tree, -56 best solution, best possible -57.7975 (212.61 seconds) Cbc0010I After 22000 nodes, 2027 on tree, -56 best solution, best possible -57.7969 (215.84 seconds) Cbc0010I After 23000 nodes, 1926 on tree, -56 best solution, best possible -57.7143 (220.98 seconds) Cbc0010I After 24000 nodes, 1719 on tree, -56 best solution, best possible -57.6224 (224.57 seconds) Cbc0010I After 25000 nodes, 1466 on tree, -56 best solution, best possible -57.5119 (227.38 seconds) Cbc0010I After 26000 nodes, 1179 on tree, -56 best solution, best possible -57.5119 (229.99 seconds) Cbc0010I After 27000 nodes, 870 on tree, -56 best solution, best possible -57.3392 (231.99 seconds) Cbc0010I After 28000 nodes, 464 on tree, -56 best solution, best possible -57.0953 (233.17 seconds) Cbc0010I After 29000 nodes, 352 on tree, -56 best solution, best possible -57 (237.06 seconds) Cbc0010I After 30000 nodes, 23 on tree, -56 best solution, best possible -57 (240.41 seconds) Cbc0001I Search completed - best objective -56, took 486421 iterations and 30140 nodes (241.02 seconds) Cbc0032I Strong branching done 11544 times (187498 iterations), fathomed 117 nodes and fixed 1098 variables Cbc0035I Maximum depth 45, 195485 variables fixed on reduced cost Cuts at root node changed objective from -86.8082 to -74.8747 Probing was tried 26336 times and created 29739 cuts of which 20090 were active after adding rounds of cuts (181.391 seconds) Gomory was tried 6354 times and created 72513 cuts of which 4629 were active after adding rounds of cuts (2.572 seconds) Knapsack was tried 6374 times and created 33626 cuts of which 744 were active after adding rounds of cuts (4.920 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) MixedIntegerRounding2 was tried 100 times and created 255 cuts of which 0 were active after adding rounds of cuts (0.388 seconds) FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.032 seconds) TwoMirCuts was tried 100 times and created 999 cuts of which 0 were active after adding rounds of cuts (0.092 seconds) implication was tried 26086 times and created 0 cuts of which 0 were active after adding rounds of cuts Result - Finished objective -56 after 30140 nodes and 486421 iterations - took 241.14 seconds (total time 241.16) Total time 241.16 241.15user 0.23system 4:01.40elapsed 99%CPU (0avgtext+0avgdata 0maxresident)k 0inputs+0outputs (0major+46691minor)pagefaults 0swaps