--- Job ran12x21 Start 08/24/08 05:45:50 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 --- ran12x21.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran12x21.gdx --- ran12x21.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.007 --- ran12x21.gms(123) 4 Mb --- Generating MIP model m --- ran12x21.gms(124) 4 Mb --- 286 rows 505 columns 1,513 non-zeroes --- 252 discrete-columns --- Executing Cbc: elapsed 0:00:00.016 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 504 columns and 285 rows. 252 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.20.00, build Aug 23 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 3157.38 - 0.01 seconds Optimal - objective value 3157.38 processed model has 285 rows, 504 columns (252 integer) and 1008 elements Pass 1: suminf. 2.23721 (11) obj. 3297.4 iterations 69 Solution found of 4511 Before mini branch and bound, 228 integers at bound fixed and 227 continuous Full problem 285 rows 504 columns, reduced to 29 rows 35 columns Mini branch and bound improved solution from 4511 to 4033 (0.02 seconds) Round again with cutoff of 3945.44 Pass 2: suminf. 2.23721 (11) obj. 3304.56 iterations 59 Pass 3: suminf. 0.47637 (3) obj. 3945.44 iterations 68 Pass 4: suminf. 0.28725 (3) obj. 3906.86 iterations 17 Pass 5: suminf. 3.73674 (14) obj. 3945.44 iterations 127 Pass 6: suminf. 1.14284 (7) obj. 3945.44 iterations 87 Pass 7: suminf. 1.60550 (9) obj. 3945.44 iterations 74 Pass 8: suminf. 1.09992 (8) obj. 3945.44 iterations 50 Pass 9: suminf. 1.70686 (10) obj. 3945.44 iterations 52 Pass 10: suminf. 1.62104 (9) obj. 3945.44 iterations 35 Pass 11: suminf. 1.45524 (9) obj. 3945.44 iterations 62 Pass 12: suminf. 1.28464 (8) obj. 3945.44 iterations 41 Pass 13: suminf. 1.80075 (9) obj. 3945.44 iterations 59 Pass 14: suminf. 1.01888 (9) obj. 3945.44 iterations 36 Pass 15: suminf. 1.55308 (9) obj. 3945.44 iterations 63 Pass 16: suminf. 0.78031 (8) obj. 3945.44 iterations 55 Pass 17: suminf. 0.86688 (9) obj. 3945.44 iterations 45 Pass 18: suminf. 0.68864 (8) obj. 3945.44 iterations 39 Pass 19: suminf. 1.04551 (8) obj. 3945.44 iterations 39 Pass 20: suminf. 1.04551 (8) obj. 3945.44 iterations 26 Pass 21: suminf. 1.39937 (8) obj. 3945.44 iterations 57 No solution found this major pass Before mini branch and bound, 200 integers at bound fixed and 200 continuous Full problem 285 rows 504 columns, reduced to 72 rows 98 columns Mini branch and bound did not improve solution (0.14 seconds) After 0.14 seconds - Feasibility pump exiting with objective of 4033 - took 0.14 seconds Integer solution of 4033 found by feasibility pump after 0 iterations and 0 nodes (0.14 seconds) Full problem 285 rows 504 columns, reduced to 0 rows 0 columns 46 added rows had average density of 109.739 At root node, 46 cuts changed objective from 3157.38 to 3443.04 in 23 passes Cut generator 0 (Probing) - 0 row cuts, 0 column cuts (0 active) in 0.060 seconds - new frequency is 1000 Cut generator 1 (Gomory) - 924 row cuts, 0 column cuts (43 active) in 0.096 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 106 row cuts, 0 column cuts (3 active) in 0.020 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in -0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 168 row cuts, 0 column cuts (0 active) in 0.008 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 86 row cuts, 0 column cuts (0 active) in 0.100 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 410 row cuts, 0 column cuts (0 active) in 0.080 seconds - new frequency is -100 Optimal - objective value 3443.04 Optimal - objective value 3443.04 After 0 nodes, 1 on tree, 4033 best solution, best possible 3443.04 (1.40 seconds) After 1000 nodes, 130 on tree, 4033 best solution, best possible 3445.49 (8.90 seconds) After 2000 nodes, 143 on tree, 4033 best solution, best possible 3445.49 (11.16 seconds) Strong branching is fixing too many variables, too expensively! After 3000 nodes, 137 on tree, 4033 best solution, best possible 3445.49 (13.43 seconds) After 4000 nodes, 162 on tree, 4033 best solution, best possible 3445.49 (15.77 seconds) After 5000 nodes, 149 on tree, 4033 best solution, best possible 3445.49 (17.86 seconds) After 6000 nodes, 156 on tree, 4033 best solution, best possible 3445.49 (20.26 seconds) Integer solution of 4028 found after 90652 iterations and 6580 nodes (21.34 seconds) Full problem 285 rows 504 columns, reduced to 50 rows 62 columns Integer solution of 3909 found by combine solutions after 90732 iterations and 6581 nodes (22.31 seconds) After 7000 nodes, 278 on tree, 3909 best solution, best possible 3454.92 (24.25 seconds) Integer solution of 3776 found after 113294 iterations and 7526 nodes (26.02 seconds) Full problem 285 rows 504 columns, reduced to 65 rows 85 columns After 8000 nodes, 526 on tree, 3776 best solution, best possible 3454.92 (28.57 seconds) Integer solution of 3769 found after 124616 iterations and 8091 nodes (28.88 seconds) Full problem 285 rows 504 columns, reduced to 70 rows 93 columns Integer solution of 3760 found after 141768 iterations and 8821 nodes (32.72 seconds) Full problem 285 rows 504 columns, reduced to 77 rows 104 columns After 9000 nodes, 888 on tree, 3760 best solution, best possible 3457.71 (35.04 seconds) Integer solution of 3752 found after 153635 iterations and 9218 nodes (35.78 seconds) Full problem 285 rows 504 columns, reduced to 80 rows 109 columns Integer solution of 3751 found by combine solutions after 153684 iterations and 9219 nodes (37.36 seconds) After 10000 nodes, 1311 on tree, 3751 best solution, best possible 3532.03 (41.14 seconds) After 11000 nodes, 1792 on tree, 3751 best solution, best possible 3551.5 (45.64 seconds) After 12000 nodes, 2260 on tree, 3751 best solution, best possible 3562.52 (49.92 seconds) After 13000 nodes, 2718 on tree, 3751 best solution, best possible 3570.72 (54.79 seconds) After 14000 nodes, 3091 on tree, 3751 best solution, best possible 3570.72 (58.33 seconds) After 15000 nodes, 3536 on tree, 3751 best solution, best possible 3577.34 (63.25 seconds) After 16000 nodes, 3960 on tree, 3751 best solution, best possible 3582.53 (67.92 seconds) After 17000 nodes, 4369 on tree, 3751 best solution, best possible 3586.77 (72.73 seconds) After 18000 nodes, 4718 on tree, 3751 best solution, best possible 3586.77 (76.20 seconds) After 19000 nodes, 5104 on tree, 3751 best solution, best possible 3591.31 (80.72 seconds) After 20000 nodes, 5492 on tree, 3751 best solution, best possible 3595.25 (85.33 seconds) After 21000 nodes, 5888 on tree, 3751 best solution, best possible 3598.41 (89.75 seconds) Integer solution of 3710 found after 469716 iterations and 21306 nodes (90.67 seconds) Full problem 285 rows 504 columns, reduced to 84 rows 115 columns After 22000 nodes, 4790 on tree, 3710 best solution, best possible 3600.32 (95.30 seconds) After 23000 nodes, 5059 on tree, 3710 best solution, best possible 3602.91 (99.35 seconds) After 24000 nodes, 5307 on tree, 3710 best solution, best possible 3605.49 (103.13 seconds) After 25000 nodes, 5548 on tree, 3710 best solution, best possible 3608.08 (107.04 seconds) After 26000 nodes, 5737 on tree, 3710 best solution, best possible 3608.08 (109.87 seconds) After 27000 nodes, 5957 on tree, 3710 best solution, best possible 3610.47 (113.58 seconds) After 28000 nodes, 6154 on tree, 3710 best solution, best possible 3612.93 (117.25 seconds) After 29000 nodes, 6357 on tree, 3710 best solution, best possible 3614.73 (120.69 seconds) Integer solution of 3683 found after 601938 iterations and 29155 nodes (121.12 seconds) Full problem 285 rows 504 columns, reduced to 85 rows 117 columns After 30000 nodes, 4782 on tree, 3683 best solution, best possible 3616.52 (125.86 seconds) After 31000 nodes, 4856 on tree, 3683 best solution, best possible 3618.2 (129.05 seconds) After 32000 nodes, 4975 on tree, 3683 best solution, best possible 3620.01 (132.38 seconds) After 33000 nodes, 5064 on tree, 3683 best solution, best possible 3621.62 (135.54 seconds) Integer solution of 3681 found after 658588 iterations and 33875 nodes (137.82 seconds) Full problem 285 rows 504 columns, reduced to 85 rows 117 columns After 34000 nodes, 4943 on tree, 3681 best solution, best possible 3621.95 (139.97 seconds) After 35000 nodes, 5027 on tree, 3681 best solution, best possible 3623.8 (143.05 seconds) After 36000 nodes, 5083 on tree, 3681 best solution, best possible 3625.36 (146.26 seconds) After 37000 nodes, 5148 on tree, 3681 best solution, best possible 3626.84 (149.40 seconds) After 38000 nodes, 5130 on tree, 3681 best solution, best possible 3626.84 (151.84 seconds) After 39000 nodes, 5199 on tree, 3681 best solution, best possible 3628.52 (154.93 seconds) After 40000 nodes, 5252 on tree, 3681 best solution, best possible 3630.02 (157.97 seconds) After 41000 nodes, 5306 on tree, 3681 best solution, best possible 3631.63 (160.98 seconds) After 42000 nodes, 5254 on tree, 3681 best solution, best possible 3631.63 (163.35 seconds) After 43000 nodes, 5316 on tree, 3681 best solution, best possible 3633.21 (166.46 seconds) After 44000 nodes, 5371 on tree, 3681 best solution, best possible 3634.77 (169.49 seconds) After 45000 nodes, 5418 on tree, 3681 best solution, best possible 3636.23 (172.51 seconds) After 46000 nodes, 5364 on tree, 3681 best solution, best possible 3636.23 (174.87 seconds) After 47000 nodes, 5416 on tree, 3681 best solution, best possible 3637.84 (177.98 seconds) After 48000 nodes, 5448 on tree, 3681 best solution, best possible 3639.25 (180.92 seconds) After 49000 nodes, 5484 on tree, 3681 best solution, best possible 3640.7 (183.91 seconds) After 50000 nodes, 5425 on tree, 3681 best solution, best possible 3640.7 (186.22 seconds) After 51000 nodes, 5472 on tree, 3681 best solution, best possible 3642.2 (189.26 seconds) After 52000 nodes, 5497 on tree, 3681 best solution, best possible 3643.7 (192.34 seconds) After 53000 nodes, 5514 on tree, 3681 best solution, best possible 3645.18 (195.21 seconds) Integer solution of 3677 found after 883764 iterations and 53656 nodes (196.66 seconds) Full problem 285 rows 504 columns, reduced to 87 rows 120 columns After 54000 nodes, 4889 on tree, 3677 best solution, best possible 3645.73 (199.82 seconds) After 55000 nodes, 4888 on tree, 3677 best solution, best possible 3647.04 (202.81 seconds) After 56000 nodes, 4877 on tree, 3677 best solution, best possible 3648.37 (205.74 seconds) After 57000 nodes, 4853 on tree, 3677 best solution, best possible 3649.64 (208.48 seconds) Integer solution of 3664 found after 921296 iterations and 57240 nodes (209.01 seconds) Full problem 285 rows 504 columns, reduced to 87 rows 120 columns After 58000 nodes, 2737 on tree, 3664 best solution, best possible 3650.56 (213.30 seconds) After 59000 nodes, 2614 on tree, 3664 best solution, best possible 3651.87 (215.89 seconds) After 60000 nodes, 2464 on tree, 3664 best solution, best possible 3652.99 (218.40 seconds) After 61000 nodes, 2308 on tree, 3664 best solution, best possible 3654.1 (220.81 seconds) After 62000 nodes, 2021 on tree, 3664 best solution, best possible 3654.1 (222.63 seconds) After 63000 nodes, 1868 on tree, 3664 best solution, best possible 3655.5 (225.04 seconds) After 64000 nodes, 1678 on tree, 3664 best solution, best possible 3656.86 (227.40 seconds) After 65000 nodes, 1464 on tree, 3664 best solution, best possible 3658.06 (229.63 seconds) After 66000 nodes, 1152 on tree, 3664 best solution, best possible 3658.06 (231.34 seconds) After 67000 nodes, 929 on tree, 3664 best solution, best possible 3659.54 (233.59 seconds) After 68000 nodes, 679 on tree, 3664 best solution, best possible 3661.07 (235.79 seconds) After 69000 nodes, 387 on tree, 3664 best solution, best possible 3662.58 (237.75 seconds) After 70000 nodes, 4 on tree, 3664 best solution, best possible 3663.24 (239.43 seconds) Search completed - best objective 3664, took 1040796 iterations and 70006 nodes (239.44 seconds) Strong branching done 4832 times (72654 iterations), fathomed 44 nodes and fixed 659 variables Maximum depth 90, 1.05938e+06 variables fixed on reduced cost Cuts at root node changed objective from 3157.38 to 3443.04 Probing was tried 30318 times and created 24965 cuts of which 8804 were active after adding rounds of cuts (11.169 seconds) Gomory was tried 12973 times and created 33386 cuts of which 10674 were active after adding rounds of cuts (8.237 seconds) Knapsack was tried 18836 times and created 39279 cuts of which 12544 were active after adding rounds of cuts (10.773 seconds) Clique was tried 23 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 18836 times and created 37893 cuts of which 11381 were active after adding rounds of cuts (4.308 seconds) FlowCover was tried 18836 times and created 2000 cuts of which 374 were active after adding rounds of cuts (0.524 seconds) TwoMirCuts was tried 23 times and created 410 cuts of which 0 were active after adding rounds of cuts (0.080 seconds) Result - Finished objective 3664 after 70006 nodes and 1040796 iterations - took 239.45 seconds (total time 239.45) Total time 239.47 Solved to optimality. MIP solution: 3664 (70006 nodes, 239.47 seconds) Best possible: 3664 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- ran12x21.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran12x21.gms Stop 08/24/08 05:49:55 elapsed 0:04:04.315