--- Job mod011 Start 08/21/08 23:29:11 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 --- mod011.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/mod011.gdx --- mod011.gms(148) 5 Mb --- Starting execution: elapsed 0:00:00.052 --- mod011.gms(123) 5 Mb --- Generating MIP model m --- mod011.gms(124) 7 Mb --- 4,481 rows 10,968 columns 29,849 non-zeroes --- 96 discrete-columns --- mod011.gms(124) 7 Mb --- Executing COINCBC: elapsed 0:00:00.184 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 10967 columns and 4480 rows. 96 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 -6.2122e+07 - 0.34 seconds 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 substitutions processed model has 1464 rows, 7103 columns (96 integer) and 15066 elements Pass 1: suminf. 0.00000 obj. 0 iterations 4215 Solution found of 0 Before mini branch and bound, 80 integers at bound fixed and 5205 continuous Full problem 1464 rows 7103 columns, reduced to 82 rows 843 columns Mini branch and bound improved solution from 0 to -4.27748e+07 (0.45 seconds) Freeing continuous variables gives a solution of -4.27748e+07 Round again with cutoff of -4.47056e+07 Pass 2: suminf. 2.07046 obj. -4.47056e+07 iterations 952 Pass 3: suminf. 0.99849 obj. -4.47056e+07 iterations 502 Pass 4: suminf. 0.73525 obj. -4.47056e+07 iterations 65 Pass 5: suminf. 0.00000 obj. -4.47056e+07 iterations 723 Solution found of -4.47056e+07 Before mini branch and bound, 80 integers at bound fixed and 4905 continuous Full problem 1464 rows 7103 columns, reduced to 437 rows 1553 columns Mini branch and bound improved solution from -4.47056e+07 to -5.17443e+07 (0.94 seconds) Freeing continuous variables gives a solution of -5.27967e+07 After 0.96 seconds - Feasibility pump exiting with objective of -5.27967e+07 - took 0.96 seconds Integer solution of -5.27967e+07 found by feasibility pump after 0 iterations and 0 nodes (0.97 seconds) Full problem 1464 rows 7103 columns, reduced to 893 rows 3545 columns Integer solution of -5.35182e+07 found by combine solutions after 0 iterations and 0 nodes (1.28 seconds) 223 added rows had average density of 29.9462 At root node, 223 cuts changed objective from -6.2082e+07 to -5.76319e+07 in 20 passes Cut generator 0 (Probing) - 849 row cuts (199 active), 0 column cuts in 0.076 seconds - new frequency is 1 Cut generator 1 (Gomory) - 15 row cuts (8 active), 0 column cuts in 0.108 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.116 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 80 row cuts (5 active), 0 column cuts in 0.028 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 20 row cuts (3 active), 0 column cuts in 0.300 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 89 row cuts (8 active), 0 column cuts in 0.088 seconds - new frequency is -100 After 0 nodes, 1 on tree, -5.35182e+07 best solution, best possible -5.76319e+07 (3.50 seconds) After 100 nodes, 24 on tree, -5.35182e+07 best solution, best possible -5.74517e+07 (19.53 seconds) After 200 nodes, 32 on tree, -5.35182e+07 best solution, best possible -5.74517e+07 (25.31 seconds) After 300 nodes, 30 on tree, -5.35182e+07 best solution, best possible -5.74517e+07 (28.78 seconds) After 400 nodes, 26 on tree, -5.35182e+07 best solution, best possible -5.74517e+07 (31.36 seconds) After 500 nodes, 28 on tree, -5.35182e+07 best solution, best possible -5.74517e+07 (34.72 seconds) After 600 nodes, 27 on tree, -5.35182e+07 best solution, best possible -5.74517e+07 (37.59 seconds) After 700 nodes, 32 on tree, -5.35182e+07 best solution, best possible -5.74517e+07 (39.83 seconds) Integer solution of -5.35319e+07 found after 72796 iterations and 718 nodes (40.15 seconds) Full problem 1464 rows 7103 columns, reduced to 927 rows 4272 columns - too large After 800 nodes, 66 on tree, -5.35319e+07 best solution, best possible -5.68477e+07 (44.02 seconds) After 900 nodes, 106 on tree, -5.35319e+07 best solution, best possible -5.68477e+07 (47.28 seconds) Integer solution of -5.36456e+07 found after 111870 iterations and 992 nodes (50.31 seconds) Full problem 1464 rows 7103 columns, reduced to 970 rows 4375 columns - too large After 1000 nodes, 136 on tree, -5.36456e+07 best solution, best possible -5.68477e+07 (50.61 seconds) Integer solution of -5.36583e+07 found after 123024 iterations and 1078 nodes (52.35 seconds) Full problem 1464 rows 7103 columns, reduced to 1019 rows 4976 columns - too large After 1100 nodes, 136 on tree, -5.36583e+07 best solution, best possible -5.68477e+07 (52.87 seconds) Integer solution of -5.3867e+07 found after 126129 iterations and 1112 nodes (53.08 seconds) Full problem 1464 rows 7103 columns, reduced to 1019 rows 4976 columns - too large Integer solution of -5.39962e+07 found after 132846 iterations and 1170 nodes (54.52 seconds) Full problem 1464 rows 7103 columns, reduced to 1019 rows 4976 columns - too large After 1200 nodes, 108 on tree, -5.39962e+07 best solution, best possible -5.68477e+07 (55.57 seconds) After 1300 nodes, 118 on tree, -5.39962e+07 best solution, best possible -5.68477e+07 (57.86 seconds) After 1400 nodes, 127 on tree, -5.39962e+07 best solution, best possible -5.68278e+07 (60.21 seconds) After 1500 nodes, 141 on tree, -5.39962e+07 best solution, best possible -5.68278e+07 (62.50 seconds) Integer solution of -5.42057e+07 found after 174025 iterations and 1525 nodes (62.95 seconds) Full problem 1464 rows 7103 columns, reduced to 1045 rows 5035 columns - too large After 1600 nodes, 160 on tree, -5.42057e+07 best solution, best possible -5.59193e+07 (65.46 seconds) After 1700 nodes, 205 on tree, -5.42057e+07 best solution, best possible -5.57237e+07 (68.04 seconds) After 1800 nodes, 250 on tree, -5.42057e+07 best solution, best possible -5.55731e+07 (70.65 seconds) After 1900 nodes, 291 on tree, -5.42057e+07 best solution, best possible -5.54995e+07 (73.32 seconds) After 2000 nodes, 333 on tree, -5.42057e+07 best solution, best possible -5.54083e+07 (76.02 seconds) After 2100 nodes, 370 on tree, -5.42057e+07 best solution, best possible -5.53559e+07 (78.77 seconds) After 2200 nodes, 405 on tree, -5.42057e+07 best solution, best possible -5.53085e+07 (81.16 seconds) After 2300 nodes, 441 on tree, -5.42057e+07 best solution, best possible -5.52654e+07 (83.70 seconds) After 2400 nodes, 464 on tree, -5.42057e+07 best solution, best possible -5.52066e+07 (85.96 seconds) After 2500 nodes, 491 on tree, -5.42057e+07 best solution, best possible -5.51733e+07 (88.33 seconds) After 2600 nodes, 509 on tree, -5.42057e+07 best solution, best possible -5.51469e+07 (90.87 seconds) After 2700 nodes, 529 on tree, -5.42057e+07 best solution, best possible -5.51153e+07 (93.25 seconds) After 2800 nodes, 548 on tree, -5.42057e+07 best solution, best possible -5.50936e+07 (95.71 seconds) After 2900 nodes, 565 on tree, -5.42057e+07 best solution, best possible -5.50601e+07 (98.06 seconds) After 3000 nodes, 585 on tree, -5.42057e+07 best solution, best possible -5.50261e+07 (100.38 seconds) After 3100 nodes, 604 on tree, -5.42057e+07 best solution, best possible -5.49962e+07 (102.71 seconds) After 3200 nodes, 620 on tree, -5.42057e+07 best solution, best possible -5.49601e+07 (105.13 seconds) After 3300 nodes, 627 on tree, -5.42057e+07 best solution, best possible -5.49369e+07 (107.16 seconds) After 3400 nodes, 634 on tree, -5.42057e+07 best solution, best possible -5.49198e+07 (109.34 seconds) After 3500 nodes, 642 on tree, -5.42057e+07 best solution, best possible -5.48941e+07 (111.54 seconds) After 3600 nodes, 652 on tree, -5.42057e+07 best solution, best possible -5.48809e+07 (113.69 seconds) After 3700 nodes, 658 on tree, -5.42057e+07 best solution, best possible -5.48681e+07 (115.76 seconds) After 3800 nodes, 665 on tree, -5.42057e+07 best solution, best possible -5.48476e+07 (117.90 seconds) After 3900 nodes, 672 on tree, -5.42057e+07 best solution, best possible -5.48291e+07 (120.12 seconds) After 4000 nodes, 678 on tree, -5.42057e+07 best solution, best possible -5.48103e+07 (122.22 seconds) After 4100 nodes, 684 on tree, -5.42057e+07 best solution, best possible -5.47929e+07 (124.28 seconds) After 4200 nodes, 690 on tree, -5.42057e+07 best solution, best possible -5.47815e+07 (126.32 seconds) After 4300 nodes, 696 on tree, -5.42057e+07 best solution, best possible -5.47632e+07 (128.58 seconds) After 4400 nodes, 702 on tree, -5.42057e+07 best solution, best possible -5.4748e+07 (130.73 seconds) After 4500 nodes, 709 on tree, -5.42057e+07 best solution, best possible -5.47364e+07 (132.78 seconds) After 4600 nodes, 715 on tree, -5.42057e+07 best solution, best possible -5.47255e+07 (135.09 seconds) After 4700 nodes, 716 on tree, -5.42057e+07 best solution, best possible -5.47122e+07 (137.13 seconds) After 4800 nodes, 717 on tree, -5.42057e+07 best solution, best possible -5.46993e+07 (139.21 seconds) After 4900 nodes, 723 on tree, -5.42057e+07 best solution, best possible -5.46894e+07 (141.08 seconds) After 5000 nodes, 729 on tree, -5.42057e+07 best solution, best possible -5.46774e+07 (143.26 seconds) After 5100 nodes, 728 on tree, -5.42057e+07 best solution, best possible -5.46645e+07 (145.23 seconds) After 5200 nodes, 733 on tree, -5.42057e+07 best solution, best possible -5.46566e+07 (147.15 seconds) After 5300 nodes, 736 on tree, -5.42057e+07 best solution, best possible -5.46429e+07 (149.17 seconds) After 5400 nodes, 738 on tree, -5.42057e+07 best solution, best possible -5.46317e+07 (151.12 seconds) After 5500 nodes, 738 on tree, -5.42057e+07 best solution, best possible -5.46237e+07 (153.05 seconds) After 5600 nodes, 741 on tree, -5.42057e+07 best solution, best possible -5.46123e+07 (155.10 seconds) After 5700 nodes, 741 on tree, -5.42057e+07 best solution, best possible -5.46031e+07 (156.92 seconds) After 5800 nodes, 739 on tree, -5.42057e+07 best solution, best possible -5.45969e+07 (158.97 seconds) After 5900 nodes, 741 on tree, -5.42057e+07 best solution, best possible -5.45889e+07 (160.88 seconds) After 6000 nodes, 742 on tree, -5.42057e+07 best solution, best possible -5.45816e+07 (162.99 seconds) After 6100 nodes, 744 on tree, -5.42057e+07 best solution, best possible -5.4572e+07 (165.09 seconds) Integer solution of -5.45585e+07 found after 658774 iterations and 6169 nodes (166.49 seconds) Full problem 1464 rows 7103 columns, reduced to 1045 rows 5035 columns - too large After 6200 nodes, 19 on tree, -5.45585e+07 best solution, best possible -5.45621e+07 (167.34 seconds) Search completed - best objective -54558535.01422734, took 666419 iterations and 6244 nodes (168.17 seconds) Strong branching done 1976 times (104526 iterations), fathomed 7 nodes and fixed 118 variables Maximum depth 46, 1176 variables fixed on reduced cost Cuts at root node changed objective from -6.2082e+07 to -5.76319e+07 Probing was tried 956 times and created 13739 cuts of which 6774 were active after adding rounds of cuts (2.296 seconds) Gomory was tried 20 times and created 15 cuts of which 8 were active after adding rounds of cuts (0.108 seconds) Knapsack was tried 20 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.116 seconds) Clique was tried 20 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) MixedIntegerRounding2 was tried 20 times and created 80 cuts of which 5 were active after adding rounds of cuts (0.028 seconds) FlowCover was tried 20 times and created 20 cuts of which 3 were active after adding rounds of cuts (0.300 seconds) TwoMirCuts was tried 20 times and created 89 cuts of which 8 were active after adding rounds of cuts (0.088 seconds) 862 bounds tightened after postprocessing Result - Finished objective -54558535.01422734 after 6244 nodes and 666419 iterations - took 168.35 seconds (total time 168.70) Total time 169.20 Solved to optimality. MIP solution: -54558535.01 (6244 nodes, 169.21 seconds) Best possible: -54558535.01 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- mod011.gms(124) 0 Mb --- Reading solution for model m --- mod011.gms(124) 5 Mb *** Status: Normal completion --- Job mod011.gms Stop 08/21/08 23:32:02 elapsed 0:02:50.942