--- Job prod1 Start 08/24/08 05:26:14 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 --- prod1.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/prod1.gdx --- prod1.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.010 --- prod1.gms(123) 4 Mb --- Generating MIP model m --- prod1.gms(124) 4 Mb --- 209 rows 251 columns 5,352 non-zeroes --- 149 discrete-columns --- Executing Cbc: elapsed 0:00:00.025 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 250 columns and 208 rows. 149 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 -100 - 0.01 seconds Optimal - objective value -100 0 fixed, 0 tightened bounds, 0 strengthened rows, 100 substitutions 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 Pass 1: suminf. 12.81070 (51) obj. -86.1161 iterations 18 Pass 2: suminf. 11.84728 (49) obj. -85.1527 iterations 2 Pass 3: suminf. 6.06666 (35) obj. -76.9333 iterations 16 Pass 4: suminf. 0.85982 (14) obj. -61.1402 iterations 27 Pass 5: suminf. 0.00093 (1) obj. -48.9991 iterations 18 Pass 6: suminf. 0.00093 (1) obj. -48.9991 iterations 0 Pass 7: suminf. 3.97116 (17) obj. -52.4736 iterations 34 Pass 8: suminf. 3.53319 (13) obj. -52.4668 iterations 7 Solution found of -43 Before mini branch and bound, 80 integers at bound fixed and 0 continuous Full problem 107 rows 149 columns, reduced to 69 rows 64 columns Mini branch and bound improved solution from -43 to -50 (0.04 seconds) Round again with cutoff of -55 Pass 9: suminf. 12.81070 (51) obj. -86.1161 iterations 18 Pass 10: suminf. 11.84728 (49) obj. -85.1527 iterations 2 Pass 11: suminf. 6.40191 (36) obj. -77.5981 iterations 15 Pass 12: suminf. 2.85783 (24) obj. -69.1422 iterations 13 Pass 13: suminf. 0.55309 (11) obj. -58.4469 iterations 16 Pass 14: suminf. 0.70320 (8) obj. -55 iterations 8 Pass 15: suminf. 0.70320 (8) obj. -55 iterations 5 Pass 16: suminf. 0.64463 (8) obj. -55 iterations 4 Pass 17: suminf. 0.64463 (8) obj. -55 iterations 2 Pass 18: suminf. 0.70320 (8) obj. -55 iterations 4 Pass 19: suminf. 4.98080 (19) obj. -55 iterations 40 Pass 20: suminf. 3.58612 (17) obj. -55 iterations 6 Pass 21: suminf. 3.53767 (16) obj. -55 iterations 1 Pass 22: suminf. 3.53767 (16) obj. -55 iterations 1 Pass 23: suminf. 3.00000 (15) obj. -55 iterations 7 Pass 24: suminf. 2.90543 (15) obj. -55.0946 iterations 4 Pass 25: suminf. 6.50006 (29) obj. -55 iterations 30 Pass 26: suminf. 4.19279 (22) obj. -55 iterations 13 Pass 27: suminf. 4.77210 (22) obj. -55 iterations 5 Pass 28: suminf. 6.69178 (27) obj. -55 iterations 27 No solution found this major pass Before mini branch and bound, 52 integers at bound fixed and 0 continuous Full problem 107 rows 149 columns, reduced to 101 rows 95 columns Mini branch and bound did not improve solution (0.30 seconds) After 0.30 seconds - Feasibility pump exiting with objective of -50 - took 0.30 seconds Integer solution of -50 found by feasibility pump after 0 iterations and 0 nodes (0.30 seconds) Full problem 107 rows 149 columns, reduced to 0 rows 0 columns 58 added rows had average density of 61.069 At root node, 58 cuts changed objective from -86.8082 to -82.4394 in 100 passes Cut generator 0 (Probing) - 225 row cuts, 0 column cuts (55 active) in 11.037 seconds - new frequency is 1 Cut generator 1 (Gomory) - 6210 row cuts, 0 column cuts (3 active) in 0.360 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 4912 row cuts, 0 column cuts (0 active) in 0.148 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.012 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 254 row cuts, 0 column cuts (0 active) in 0.448 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.028 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 1044 row cuts, 0 column cuts (0 active) in 0.156 seconds - new frequency is -100 Optimal - objective value -75.824 Optimal - objective value -75.824 After 0 nodes, 1 on tree, -50 best solution, best possible -75.824 (14.03 seconds) Strong branching is fixing too many variables, too expensively! Integer solution of -52 found after 6622 iterations and 14 nodes (15.78 seconds) Full problem 107 rows 149 columns, reduced to 21 rows 28 columns Full problem 107 rows 149 columns, reduced to 61 rows 74 columns After 1000 nodes, 237 on tree, -56 best solution, best possible -66.1131 (46.97 seconds) After 2000 nodes, 389 on tree, -56 best solution, best possible -65.6851 (62.30 seconds) After 3000 nodes, 518 on tree, -56 best solution, best possible -65.3882 (76.46 seconds) After 4000 nodes, 633 on tree, -56 best solution, best possible -65.3882 (91.23 seconds) After 5000 nodes, 721 on tree, -56 best solution, best possible -65.3882 (103.35 seconds) After 6000 nodes, 772 on tree, -56 best solution, best possible -65.3882 (115.57 seconds) After 7000 nodes, 873 on tree, -56 best solution, best possible -64.4969 (128.73 seconds) After 8000 nodes, 908 on tree, -56 best solution, best possible -64.4969 (140.57 seconds) After 9000 nodes, 910 on tree, -56 best solution, best possible -64.4969 (151.52 seconds) After 10000 nodes, 948 on tree, -56 best solution, best possible -64.4969 (163.60 seconds) After 11000 nodes, 1025 on tree, -56 best solution, best possible -64.4969 (176.26 seconds) After 12000 nodes, 1158 on tree, -56 best solution, best possible -59.6122 (196.14 seconds) After 13000 nodes, 1329 on tree, -56 best solution, best possible -58.8998 (214.67 seconds) After 14000 nodes, 1377 on tree, -56 best solution, best possible -58.8973 (226.29 seconds) After 15000 nodes, 1673 on tree, -56 best solution, best possible -58.6136 (246.39 seconds) After 16000 nodes, 1862 on tree, -56 best solution, best possible -58.3845 (261.36 seconds) After 17000 nodes, 1955 on tree, -56 best solution, best possible -58.097 (271.65 seconds) After 18000 nodes, 1833 on tree, -56 best solution, best possible -58.097 (279.03 seconds) After 19000 nodes, 2066 on tree, -56 best solution, best possible -57.9152 (294.99 seconds) After 20000 nodes, 2195 on tree, -56 best solution, best possible -57.8401 (308.39 seconds) After 21000 nodes, 2150 on tree, -56 best solution, best possible -57.7719 (317.38 seconds) After 22000 nodes, 1900 on tree, -56 best solution, best possible -57.7719 (321.53 seconds) After 23000 nodes, 1781 on tree, -56 best solution, best possible -57.6871 (328.60 seconds) After 24000 nodes, 1565 on tree, -56 best solution, best possible -57.6102 (333.74 seconds) After 25000 nodes, 1276 on tree, -56 best solution, best possible -57.5045 (337.20 seconds) After 26000 nodes, 976 on tree, -56 best solution, best possible -57.5045 (340.61 seconds) After 27000 nodes, 627 on tree, -56 best solution, best possible -57.3099 (343.12 seconds) After 28000 nodes, 305 on tree, -56 best solution, best possible -57 (345.63 seconds) After 29000 nodes, 82 on tree, -56 best solution, best possible -57 (351.33 seconds) Search completed - best objective -56, took 485517 iterations and 29280 nodes (352.45 seconds) Strong branching done 11344 times (186569 iterations), fathomed 97 nodes and fixed 978 variables Maximum depth 50, 185699 variables fixed on reduced cost Cuts at root node changed objective from -86.8082 to -75.824 Probing was tried 25702 times and created 30466 cuts of which 21011 were active after adding rounds of cuts (271.125 seconds) Gomory was tried 6019 times and created 64852 cuts of which 4321 were active after adding rounds of cuts (3.336 seconds) Knapsack was tried 6030 times and created 33070 cuts of which 900 were active after adding rounds of cuts (2.688 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 254 cuts of which 0 were active after adding rounds of cuts (0.448 seconds) FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.028 seconds) TwoMirCuts was tried 100 times and created 1044 cuts of which 0 were active after adding rounds of cuts (0.156 seconds) implication was tried 25433 times and created 0 cuts of which 0 were active after adding rounds of cuts 100 bounds tightened after postprocessing Result - Finished objective -56 after 29280 nodes and 485517 iterations - took 352.60 seconds (total time 352.61) Total time 352.62 Solved to optimality. MIP solution: -56 (29280 nodes, 352.63 seconds) Best possible: -56 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- prod1.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job prod1.gms Stop 08/24/08 05:32:10 elapsed 0:05:56.163