--- Job dano3mip Start 08/21/08 20:25:43 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- dano3mip.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/dano3mip.gdx --- dano3mip.gms(148) 6 Mb --- Starting execution: elapsed 0:00:00.074 --- dano3mip.gms(123) 6 Mb --- Generating MIP model m --- dano3mip.gms(124) 10 Mb --- 3,203 rows 13,874 columns 79,657 non-zeroes --- 552 discrete-columns --- dano3mip.gms(124) 10 Mb --- Executing COINCBC: elapsed 0:00:00.285 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 13873 columns and 3202 rows. 552 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.10.00, build Jun 21 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 576.232 - 40.46 seconds 0 fixed, 315 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 3139 rows, 13825 columns (552 integer) and 80277 elements Pass 1: (19.39 seconds) suminf. 2.05012 obj. 871.054 iterations 28403 Pass 2: (45.30 seconds) suminf. 0.00000 obj. 939.25 iterations 20183 Solution found of 939.25 Before mini branch and bound, 424 integers at bound fixed and 12082 continuous Full problem 3139 rows 13825 columns, reduced to 1371 rows 1156 columns Mini branch and bound improved solution from 939.25 to 780.875 (56.59 seconds) Freeing continuous variables gives a solution of 756.625 Round again with cutoff of 738.586 Pass 3: (70.48 seconds) suminf. 2.60686 obj. 738.586 iterations 24061 Pass 4: (100.82 seconds) suminf. 0.57726 obj. 738.586 iterations 28520 Pass 5: (114.10 seconds) suminf. 0.32144 obj. 738.586 iterations 17574 Pass 6: (126.40 seconds) suminf. 3.38200 obj. 738.586 iterations 19470 Pass 7: (130.79 seconds) suminf. 1.84272 obj. 738.586 iterations 6831 Pass 8: (135.61 seconds) suminf. 1.09935 obj. 738.586 iterations 8832 Pass 9: (142.02 seconds) suminf. 3.75806 obj. 738.586 iterations 12262 Pass 10: (147.15 seconds) suminf. 1.44183 obj. 738.586 iterations 9263 Pass 11: (148.23 seconds) suminf. 1.09655 obj. 738.586 iterations 2409 Pass 12: (163.46 seconds) suminf. 2.56738 obj. 738.586 iterations 20121 Pass 13: (176.19 seconds) suminf. 0.00000 obj. 738.586 iterations 15425 Solution found of 738.586 Before mini branch and bound, 312 integers at bound fixed and 11285 continuous Full problem 3139 rows 13825 columns, reduced to 1905 rows 2156 columns Mini branch and bound did not improve solution (290.75 seconds) After 290.75 seconds - Feasibility pump exiting with objective of 4.77396e-15 - took 290.72 seconds Integer solution of 756.625 found by feasibility pump after 0 iterations and 0 nodes (297.18 seconds) 93 added rows had average density of 4.47312 At root node, 93 cuts changed objective from 576.232 to 576.418 in 3 passes Cut generator 0 (Probing) - 103 row cuts (93 active), 15 column cuts in 0.240 seconds - new frequency is 1 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.056 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.064 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 2 row cuts (0 active), 0 column cuts in 0.044 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.204 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 2 row cuts (0 active), 0 column cuts in 0.280 seconds - new frequency is -100 After 0 nodes, 1 on tree, 756.625 best solution, best possible 576.418 (304.83 seconds) After 100 nodes, 53 on tree, 756.625 best solution, best possible 576.611 (624.16 seconds) After 200 nodes, 108 on tree, 756.625 best solution, best possible 576.611 (878.23 seconds) After 300 nodes, 160 on tree, 756.625 best solution, best possible 576.611 (1082.07 seconds) After 400 nodes, 219 on tree, 756.625 best solution, best possible 576.611 (1204.40 seconds) After 500 nodes, 248 on tree, 756.625 best solution, best possible 576.611 (1242.31 seconds) After 600 nodes, 245 on tree, 756.625 best solution, best possible 576.611 (1260.73 seconds) After 700 nodes, 242 on tree, 756.625 best solution, best possible 576.611 (1281.46 seconds) After 800 nodes, 240 on tree, 756.625 best solution, best possible 576.611 (1300.13 seconds) After 900 nodes, 244 on tree, 756.625 best solution, best possible 576.611 (1319.37 seconds) After 1000 nodes, 242 on tree, 756.625 best solution, best possible 576.611 (1337.97 seconds) After 1100 nodes, 245 on tree, 756.625 best solution, best possible 576.611 (1359.75 seconds) After 1200 nodes, 243 on tree, 756.625 best solution, best possible 576.611 (1381.03 seconds) After 1300 nodes, 247 on tree, 756.625 best solution, best possible 576.611 (1399.45 seconds) After 1400 nodes, 240 on tree, 756.625 best solution, best possible 576.611 (1418.79 seconds) After 1500 nodes, 252 on tree, 756.625 best solution, best possible 576.611 (1437.07 seconds) After 1600 nodes, 248 on tree, 756.625 best solution, best possible 576.611 (1455.83 seconds) After 1700 nodes, 242 on tree, 756.625 best solution, best possible 576.611 (1474.25 seconds) After 1800 nodes, 250 on tree, 756.625 best solution, best possible 576.611 (1491.62 seconds) After 1900 nodes, 241 on tree, 756.625 best solution, best possible 576.611 (1509.63 seconds) After 2000 nodes, 246 on tree, 756.625 best solution, best possible 576.611 (1527.62 seconds) After 2100 nodes, 242 on tree, 756.625 best solution, best possible 576.611 (1544.38 seconds) After 2200 nodes, 245 on tree, 756.625 best solution, best possible 576.611 (1562.53 seconds) After 2300 nodes, 245 on tree, 756.625 best solution, best possible 576.611 (1579.73 seconds) After 2400 nodes, 241 on tree, 756.625 best solution, best possible 576.611 (1597.25 seconds) After 2500 nodes, 243 on tree, 756.625 best solution, best possible 576.611 (1616.30 seconds) After 2600 nodes, 250 on tree, 756.625 best solution, best possible 576.611 (1634.54 seconds) After 2700 nodes, 245 on tree, 756.625 best solution, best possible 576.611 (1652.87 seconds) After 2800 nodes, 247 on tree, 756.625 best solution, best possible 576.611 (1672.00 seconds) After 2900 nodes, 244 on tree, 756.625 best solution, best possible 576.611 (1689.37 seconds) After 3000 nodes, 241 on tree, 756.625 best solution, best possible 576.611 (1706.90 seconds) After 3100 nodes, 249 on tree, 756.625 best solution, best possible 576.611 (1724.31 seconds) After 3200 nodes, 240 on tree, 756.625 best solution, best possible 576.611 (1742.69 seconds) After 3300 nodes, 241 on tree, 756.625 best solution, best possible 576.611 (1760.41 seconds) After 3400 nodes, 239 on tree, 756.625 best solution, best possible 576.611 (1780.97 seconds) Exiting on maximum time Partial search - best objective 756.625 (best possible 576.611), took 1013395 iterations and 3477 nodes (1799.56 seconds) Strong branching done 5430 times (466242 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 148, 359 variables fixed on reduced cost Cuts at root node changed objective from 576.232 to 576.418 Probing was tried 518 times and created 2861 cuts of which 2167 were active after adding rounds of cuts (3.040 seconds) Gomory was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.056 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.064 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) MixedIntegerRounding2 was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.044 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.204 seconds) TwoMirCuts was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.280 seconds) 315 bounds tightened after postprocessing Result - Stopped on time objective 756.625 after 3477 nodes and 1013395 iterations - took 1800.15 seconds (total time 1840.63) Total time 1887.04 Time limit reached. Have feasible solution. MIP solution: 756.625 (3477 nodes, 1887.06 seconds) Best possible: 576.6114375 Absolute gap: 180.01 (absolute tolerance optca: 0) Relative gap: 0.31219 (relative tolerance optcr: 0) --- Restarting execution --- dano3mip.gms(124) 0 Mb --- Reading solution for model m --- dano3mip.gms(124) 6 Mb *** Status: Normal completion --- Job dano3mip.gms Stop 08/21/08 20:57:26 elapsed 0:31:42.858