Coin Cbc and Clp Solver version 2.20.00, build Aug 5 2008 command line - cbc done/prod2.mps At line 1 NAME GAMSMOD At line 7 ROWS At line 220 COLUMNS At line 10725 RHS At line 10936 BOUNDS At line 11238 ENDATA Problem GAMSMOD has 211 rows, 301 columns and 10501 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 110 rows, 200 columns (200 integer) and 10200 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Cbc0038I Pass 1: suminf. 11.27992 (50) obj. -88.7201 iterations 37 Cbc0038I Pass 2: suminf. 2.00810 (22) obj. -69.9919 iterations 42 Cbc0038I Pass 3: suminf. 0.27807 (9) obj. -58.7219 iterations 20 Cbc0038I Pass 4: suminf. 0.00046 (1) obj. -50.9995 iterations 15 Cbc0038I Pass 5: suminf. 0.00046 (1) obj. -50.9995 iterations 0 Cbc0038I Pass 6: suminf. 3.17378 (16) obj. -49.1863 iterations 48 Cbc0038I Pass 7: suminf. 1.84791 (13) obj. -49.1521 iterations 16 Cbc0038I Solution found of -38 Cbc0038I Before mini branch and bound, 111 integers at bound fixed and 0 continuous Cbc0038I Full problem 110 rows 200 columns, reduced to 91 rows 83 columns Cbc0038I Mini branch and bound improved solution from -38 to -52 (0.15 seconds) Cbc0038I Round again with cutoff of -57 Cbc0038I Pass 8: suminf. 11.27992 (50) obj. -88.7201 iterations 37 Cbc0038I Pass 9: suminf. 4.72706 (33) obj. -78.2729 iterations 24 Cbc0038I Pass 10: suminf. 2.19947 (23) obj. -70.8005 iterations 16 Cbc0038I Pass 11: suminf. 0.32160 (8) obj. -57 iterations 24 Cbc0038I Pass 12: suminf. 0.49206 (8) obj. -57 iterations 10 Cbc0038I Pass 13: suminf. 0.49206 (8) obj. -57 iterations 6 Cbc0038I Pass 14: suminf. 0.52843 (8) obj. -57 iterations 10 Cbc0038I Pass 15: suminf. 0.52843 (8) obj. -57 iterations 7 Cbc0038I Pass 16: suminf. 0.49206 (8) obj. -57 iterations 11 Cbc0038I Pass 17: suminf. 4.56479 (23) obj. -57 iterations 44 Cbc0038I Pass 18: suminf. 3.00000 (18) obj. -57 iterations 12 Cbc0038I Pass 19: suminf. 2.57253 (17) obj. -57.4275 iterations 1 Cbc0038I Pass 20: suminf. 3.00000 (17) obj. -57 iterations 6 Cbc0038I Pass 21: suminf. 6.77082 (29) obj. -57 iterations 47 Cbc0038I Pass 22: suminf. 5.24290 (25) obj. -57 iterations 13 Cbc0038I Pass 23: suminf. 4.75074 (23) obj. -57 iterations 7 Cbc0038I Pass 24: suminf. 4.63308 (23) obj. -57 iterations 6 Cbc0038I Pass 25: suminf. 4.75074 (23) obj. -57 iterations 7 Cbc0038I Pass 26: suminf. 7.62429 (36) obj. -57 iterations 38 Cbc0038I Pass 27: suminf. 6.65003 (28) obj. -57 iterations 15 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 90 integers at bound fixed and 0 continuous Cbc0038I Full problem 110 rows 200 columns, reduced to 106 rows 107 columns - too large Cbc0038I Mini branch and bound did not improve solution (0.18 seconds) Cbc0038I After 0.18 seconds - Feasibility pump exiting with objective of -52 - took 0.18 seconds Cbc0012I Integer solution of -52 found by feasibility pump after 0 iterations and 0 nodes (0.18 seconds) Cbc0038I Full problem 110 rows 200 columns, reduced to 0 rows 0 columns Cbc0012I Integer solution of -54 found by combine solutions after 0 iterations and 0 nodes (0.18 seconds) Cbc0031I 53 added rows had average density of 110.679 Cbc0013I At root node, 53 cuts changed objective from -88.8927 to -85.7629 in 100 passes Cbc0014I Cut generator 0 (Probing) - 218 row cuts, 0 column cuts (50 active) in 40.787 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 5938 row cuts, 0 column cuts (3 active) in 0.436 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in 0.036 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.016 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 199 row cuts, 0 column cuts (0 active) in 0.816 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) - 703 row cuts, 0 column cuts (0 active) in 0.148 seconds - new frequency is -100 Optimal - objective value -85.7629 Optimal - objective value -85.7629 Cbc0010I After 0 nodes, 1 on tree, -54 best solution, best possible -85.7629 (43.75 seconds) Cbc0016I Integer solution of -55 found by strong branching after 6298 iterations and 32 nodes (45.61 seconds) Cbc0038I Full problem 110 rows 200 columns, reduced to 23 rows 31 columns Cbc0012I Integer solution of -56 found by combine solutions after 6341 iterations and 33 nodes (45.69 seconds) Cbc0010I After 1000 nodes, 285 on tree, -56 best solution, best possible -70.724 (68.08 seconds) Cbc0010I After 2000 nodes, 546 on tree, -56 best solution, best possible -70.724 (83.33 seconds) Cbc0004I Integer solution of -58 found after 65768 iterations and 2333 nodes (88.60 seconds) Cbc0038I Full problem 110 rows 200 columns, reduced to 49 rows 63 columns Cbc0010I After 3000 nodes, 798 on tree, -58 best solution, best possible -69.428 (97.91 seconds) Cbc0010I After 4000 nodes, 1074 on tree, -58 best solution, best possible -68.99 (111.36 seconds) Cbc0010I After 5000 nodes, 1265 on tree, -58 best solution, best possible -68.9732 (121.75 seconds) Cbc0004I Integer solution of -60 found after 133401 iterations and 5929 nodes (130.68 seconds) Cbc0038I Full problem 110 rows 200 columns, reduced to 71 rows 91 columns Cbc0010I After 6000 nodes, 1135 on tree, -60 best solution, best possible -68.9732 (132.45 seconds) Cbc0010I After 7000 nodes, 1320 on tree, -60 best solution, best possible -68.798 (144.83 seconds) Cbc0010I After 8000 nodes, 1559 on tree, -60 best solution, best possible -68.798 (158.80 seconds) Cbc0010I After 9000 nodes, 1706 on tree, -60 best solution, best possible -68.798 (170.44 seconds) Cbc0010I After 10000 nodes, 1935 on tree, -60 best solution, best possible -68.798 (183.46 seconds) Cbc0010I After 11000 nodes, 2085 on tree, -60 best solution, best possible -68.798 (193.17 seconds) Cbc0010I After 12000 nodes, 2348 on tree, -60 best solution, best possible -65.3385 (207.98 seconds) Cbc0010I After 13000 nodes, 2609 on tree, -60 best solution, best possible -64.8098 (222.14 seconds) Cbc0010I After 14000 nodes, 2800 on tree, -60 best solution, best possible -64.8098 (230.91 seconds) Cbc0010I After 15000 nodes, 3098 on tree, -60 best solution, best possible -64.5109 (246.74 seconds) Cbc0010I After 16000 nodes, 3385 on tree, -60 best solution, best possible -64.2903 (261.96 seconds) Cbc0010I After 17000 nodes, 3590 on tree, -60 best solution, best possible -64.0717 (275.07 seconds) Cbc0010I After 18000 nodes, 3768 on tree, -60 best solution, best possible -64.0717 (285.52 seconds) Cbc0010I After 19000 nodes, 4054 on tree, -60 best solution, best possible -63.9258 (302.71 seconds) Cbc0010I After 20000 nodes, 4383 on tree, -60 best solution, best possible -63.8337 (320.92 seconds) Cbc0010I After 21000 nodes, 4732 on tree, -60 best solution, best possible -63.754 (338.57 seconds) Cbc0010I After 22000 nodes, 4934 on tree, -60 best solution, best possible -63.754 (348.62 seconds) Cbc0010I After 23000 nodes, 5303 on tree, -60 best solution, best possible -63.6885 (367.03 seconds) Cbc0010I After 24000 nodes, 5647 on tree, -60 best solution, best possible -63.6191 (384.68 seconds) Cbc0010I After 25000 nodes, 5955 on tree, -60 best solution, best possible -63.5415 (401.29 seconds) Cbc0010I After 26000 nodes, 6134 on tree, -60 best solution, best possible -63.5415 (411.39 seconds) Cbc0010I After 27000 nodes, 6389 on tree, -60 best solution, best possible -63.4608 (426.84 seconds) Cbc0010I After 28000 nodes, 6615 on tree, -60 best solution, best possible -63.3786 (442.00 seconds) Cbc0010I After 29000 nodes, 6800 on tree, -60 best solution, best possible -63.2886 (456.61 seconds) Cbc0010I After 30000 nodes, 6997 on tree, -60 best solution, best possible -63.2886 (467.45 seconds) Cbc0010I After 31000 nodes, 7151 on tree, -60 best solution, best possible -63.1834 (481.59 seconds) Cbc0010I After 32000 nodes, 7254 on tree, -60 best solution, best possible -63.0587 (495.34 seconds) Cbc0010I After 33000 nodes, 7615 on tree, -60 best solution, best possible -63 (513.90 seconds) Cbc0010I After 34000 nodes, 7844 on tree, -60 best solution, best possible -63 (525.30 seconds) Cbc0010I After 35000 nodes, 8248 on tree, -60 best solution, best possible -63 (551.50 seconds) Cbc0010I After 36000 nodes, 8715 on tree, -60 best solution, best possible -62.9944 (572.85 seconds) Cbc0010I After 37000 nodes, 9156 on tree, -60 best solution, best possible -62.9867 (594.47 seconds) Cbc0010I After 38000 nodes, 9412 on tree, -60 best solution, best possible -62.9867 (605.61 seconds) Cbc0010I After 39000 nodes, 9837 on tree, -60 best solution, best possible -62.9769 (626.64 seconds) Cbc0010I After 40000 nodes, 10262 on tree, -60 best solution, best possible -62.9665 (647.09 seconds) Cbc0010I After 41000 nodes, 10168 on tree, -60 best solution, best possible -62.9665 (652.06 seconds) Cbc0010I After 42000 nodes, 10562 on tree, -60 best solution, best possible -62.9564 (672.78 seconds) Cbc0004I Integer solution of -61 found after 895361 iterations and 42153 nodes (674.09 seconds) Cbc0038I Full problem 110 rows 200 columns, reduced to 77 rows 101 columns Cbc0010I After 43000 nodes, 8791 on tree, -61 best solution, best possible -62.9564 (682.88 seconds) Cbc0010I After 44000 nodes, 9060 on tree, -61 best solution, best possible -62.9448 (702.66 seconds) Cbc0010I After 45000 nodes, 9301 on tree, -61 best solution, best possible -62.9327 (720.71 seconds) Cbc0010I After 46000 nodes, 9210 on tree, -61 best solution, best possible -62.9327 (728.31 seconds) Cbc0010I After 47000 nodes, 9389 on tree, -61 best solution, best possible -62.9191 (746.25 seconds) Cbc0010I After 48000 nodes, 9524 on tree, -61 best solution, best possible -62.9062 (762.96 seconds) Cbc0010I After 49000 nodes, 9611 on tree, -61 best solution, best possible -62.8941 (777.92 seconds) Cbc0010I After 50000 nodes, 9528 on tree, -61 best solution, best possible -62.8941 (785.19 seconds) Cbc0010I After 51000 nodes, 9561 on tree, -61 best solution, best possible -62.8807 (799.63 seconds) Cbc0010I After 52000 nodes, 9566 on tree, -61 best solution, best possible -62.866 (813.60 seconds) Cbc0010I After 53000 nodes, 9565 on tree, -61 best solution, best possible -62.8509 (827.52 seconds) Cbc0010I After 54000 nodes, 9593 on tree, -61 best solution, best possible -62.8509 (835.32 seconds) Cbc0010I After 55000 nodes, 9542 on tree, -61 best solution, best possible -62.8355 (848.02 seconds) Cbc0010I After 56000 nodes, 9465 on tree, -61 best solution, best possible -62.8188 (860.48 seconds) Cbc0010I After 57000 nodes, 9380 on tree, -61 best solution, best possible -62.8024 (872.82 seconds) Cbc0010I After 58000 nodes, 9000 on tree, -61 best solution, best possible -62.8024 (877.94 seconds) Cbc0010I After 59000 nodes, 8871 on tree, -61 best solution, best possible -62.7848 (889.11 seconds) Cbc0010I After 60000 nodes, 8714 on tree, -61 best solution, best possible -62.767 (899.83 seconds) Cbc0010I After 61000 nodes, 8543 on tree, -61 best solution, best possible -62.7471 (909.90 seconds) Cbc0010I After 62000 nodes, 8461 on tree, -61 best solution, best possible -62.7471 (916.53 seconds) Cbc0010I After 63000 nodes, 8271 on tree, -61 best solution, best possible -62.7234 (926.32 seconds) Cbc0010I After 64000 nodes, 8052 on tree, -61 best solution, best possible -62.6982 (935.35 seconds) Cbc0010I After 65000 nodes, 7809 on tree, -61 best solution, best possible -62.67 (943.27 seconds) Cbc0010I After 66000 nodes, 8057 on tree, -61 best solution, best possible -62.67 (952.05 seconds) Cbc0010I After 67000 nodes, 7788 on tree, -61 best solution, best possible -62.6411 (958.78 seconds) Cbc0010I After 68000 nodes, 7487 on tree, -61 best solution, best possible -62.611 (964.91 seconds) Cbc0010I After 69000 nodes, 7193 on tree, -61 best solution, best possible -62.5778 (970.83 seconds) Cbc0010I After 70000 nodes, 6696 on tree, -61 best solution, best possible -62.5778 (975.76 seconds) Cbc0010I After 71000 nodes, 6360 on tree, -61 best solution, best possible -62.5416 (980.58 seconds) Cbc0010I After 72000 nodes, 6007 on tree, -61 best solution, best possible -62.4997 (985.14 seconds) Cbc0010I After 73000 nodes, 5628 on tree, -61 best solution, best possible -62.4531 (989.06 seconds) Cbc0010I After 74000 nodes, 5323 on tree, -61 best solution, best possible -62.4531 (993.87 seconds) Cbc0010I After 75000 nodes, 4898 on tree, -61 best solution, best possible -62.3879 (996.91 seconds) Cbc0010I After 76000 nodes, 4444 on tree, -61 best solution, best possible -62.3113 (999.40 seconds) Cbc0010I After 77000 nodes, 3962 on tree, -61 best solution, best possible -62.2102 (1001.21 seconds) Cbc0010I After 78000 nodes, 4237 on tree, -61 best solution, best possible -62.2102 (1010.52 seconds) Cbc0010I After 79000 nodes, 3878 on tree, -61 best solution, best possible -62 (1012.88 seconds) Cbc0010I After 80000 nodes, 4579 on tree, -61 best solution, best possible -62 (1025.86 seconds) Cbc0010I After 81000 nodes, 5188 on tree, -61 best solution, best possible -62 (1038.24 seconds) Cbc0010I After 82000 nodes, 5289 on tree, -61 best solution, best possible -62 (1046.83 seconds) Cbc0010I After 83000 nodes, 5543 on tree, -61 best solution, best possible -62 (1057.09 seconds) Cbc0010I After 84000 nodes, 5263 on tree, -61 best solution, best possible -62 (1064.66 seconds) Cbc0010I After 85000 nodes, 4930 on tree, -61 best solution, best possible -62 (1071.90 seconds) Cbc0010I After 86000 nodes, 4731 on tree, -61 best solution, best possible -62 (1079.02 seconds) Cbc0010I After 87000 nodes, 4396 on tree, -61 best solution, best possible -62 (1086.20 seconds) Cbc0010I After 88000 nodes, 4223 on tree, -61 best solution, best possible -62 (1093.69 seconds) Cbc0010I After 89000 nodes, 3934 on tree, -61 best solution, best possible -62 (1101.19 seconds) Cbc0010I After 90000 nodes, 3700 on tree, -61 best solution, best possible -62 (1107.93 seconds) Cbc0010I After 91000 nodes, 3590 on tree, -61 best solution, best possible -62 (1117.65 seconds) Cbc0010I After 92000 nodes, 3498 on tree, -61 best solution, best possible -62 (1126.78 seconds) Cbc0010I After 93000 nodes, 3248 on tree, -61 best solution, best possible -62 (1134.62 seconds) Cbc0010I After 94000 nodes, 2931 on tree, -61 best solution, best possible -62 (1140.49 seconds) Cbc0010I After 95000 nodes, 2916 on tree, -61 best solution, best possible -62 (1150.32 seconds) Cbc0010I After 96000 nodes, 2704 on tree, -61 best solution, best possible -62 (1159.06 seconds) Cbc0010I After 97000 nodes, 2551 on tree, -61 best solution, best possible -62 (1167.30 seconds) Cbc0010I After 98000 nodes, 2239 on tree, -61 best solution, best possible -62 (1172.79 seconds) Cbc0010I After 99000 nodes, 2069 on tree, -61 best solution, best possible -62 (1182.15 seconds) Cbc0010I After 100000 nodes, 1910 on tree, -61 best solution, best possible -62 (1191.69 seconds) Cbc0010I After 101000 nodes, 1746 on tree, -61 best solution, best possible -62 (1201.06 seconds) Cbc0010I After 102000 nodes, 1547 on tree, -61 best solution, best possible -62 (1207.14 seconds) Cbc0010I After 103000 nodes, 1376 on tree, -61 best solution, best possible -62 (1216.65 seconds) Cbc0010I After 104000 nodes, 1261 on tree, -61 best solution, best possible -62 (1227.17 seconds) Cbc0010I After 105000 nodes, 1151 on tree, -61 best solution, best possible -62 (1237.02 seconds) Cbc0004I Integer solution of -62 found after 1577027 iterations and 105115 nodes (1237.50 seconds) Cbc0001I Search completed - best objective -62, took 1577027 iterations and 105115 nodes (1237.53 seconds) Cbc0032I Strong branching done 17000 times (287924 iterations), fathomed 88 nodes and fixed 1385 variables Cbc0035I Maximum depth 78, 808756 variables fixed on reduced cost Cuts at root node changed objective from -88.8927 to -85.7629 Probing was tried 78314 times and created 77175 cuts of which 53080 were active after adding rounds of cuts (976.773 seconds) Gomory was tried 16072 times and created 34068 cuts of which 701 were active after adding rounds of cuts (8.777 seconds) Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.036 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) MixedIntegerRounding2 was tried 100 times and created 199 cuts of which 0 were active after adding rounds of cuts (0.816 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 703 cuts of which 0 were active after adding rounds of cuts (0.148 seconds) implication was tried 78146 times and created 0 cuts of which 0 were active after adding rounds of cuts Result - Finished objective -62 after 105115 nodes and 1577027 iterations - took 1238.10 seconds (total time 1238.12) Total time 1238.12 1238.12user 0.87system 20:39.00elapsed 99%CPU (0avgtext+0avgdata 0maxresident)k 0inputs+0outputs (0major+152403minor)pagefaults 0swaps