--- Job mod011 Start 08/24/08 04:28:43 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 --- 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.065 --- 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 Cbc: elapsed 0:00:00.209 GAMS/Cbc 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.20.00, build Aug 23 2008 command line - GAMS/CBC -solve -quit Continuous objective value is -6.2122e+07 - 0.13 seconds Optimal - objective value -6.2122e+07 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 substitutions processed model has 1435 rows, 6765 columns (96 integer) and 14654 elements Pass 1: suminf. 0.00000 (0) obj. 0 iterations 3363 Solution found of 0 Before mini branch and bound, 80 integers at bound fixed and 4920 continuous Full problem 1435 rows 6765 columns, reduced to 65 rows 809 columns Mini branch and bound improved solution from 0 to -4.27748e+07 (0.40 seconds) Freeing continuous variables gives a solution of -4.29023e+07 Round again with cutoff of -4.48203e+07 Pass 2: suminf. 2.07561 (10) obj. -4.48203e+07 iterations 999 Pass 3: suminf. 1.00582 (9) obj. -4.48203e+07 iterations 514 Pass 4: suminf. 0.74272 (8) obj. -4.48203e+07 iterations 85 Pass 5: suminf. 0.00000 (0) obj. -4.48203e+07 iterations 452 Solution found of -4.48203e+07 Before mini branch and bound, 80 integers at bound fixed and 4761 continuous Full problem 1435 rows 6765 columns, reduced to 364 rows 1316 columns Mini branch and bound improved solution from -4.48203e+07 to -5.01943e+07 (0.82 seconds) Freeing continuous variables gives a solution of -5.27967e+07 After 0.87 seconds - Feasibility pump exiting with objective of -5.27967e+07 - took 0.86 seconds Integer solution of -5.27967e+07 found by feasibility pump after 0 iterations and 0 nodes (0.88 seconds) Full problem 1435 rows 6765 columns, reduced to 891 rows 3514 columns - too large 303 added rows had average density of 107.736 At root node, 303 cuts changed objective from -6.2082e+07 to -5.64507e+07 in 20 passes Cut generator 0 (Probing) - 2076 row cuts, 0 column cuts (303 active) in 0.140 seconds - new frequency is 1 Cut generator 1 (Gomory) - 131 row cuts, 0 column cuts (0 active) in 0.168 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in 0.072 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.020 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 117 row cuts, 0 column cuts (0 active) in 0.032 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 12 row cuts, 0 column cuts (0 active) in 1.708 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 89 row cuts, 0 column cuts (0 active) in 0.132 seconds - new frequency is -100 Optimal - objective value -5.64507e+07 Optimal - objective value -5.64507e+07 After 0 nodes, 1 on tree, -5.27967e+07 best solution, best possible -5.64507e+07 (7.76 seconds) After 100 nodes, 47 on tree, -5.27967e+07 best solution, best possible -5.61107e+07 (26.49 seconds) After 200 nodes, 62 on tree, -5.27967e+07 best solution, best possible -5.61107e+07 (31.91 seconds) After 300 nodes, 58 on tree, -5.27967e+07 best solution, best possible -5.61107e+07 (34.21 seconds) After 400 nodes, 60 on tree, -5.27967e+07 best solution, best possible -5.61107e+07 (37.03 seconds) After 500 nodes, 65 on tree, -5.27967e+07 best solution, best possible -5.61107e+07 (40.62 seconds) After 600 nodes, 56 on tree, -5.27967e+07 best solution, best possible -5.61107e+07 (44.07 seconds) After 700 nodes, 70 on tree, -5.27967e+07 best solution, best possible -5.61107e+07 (47.89 seconds) After 800 nodes, 64 on tree, -5.27967e+07 best solution, best possible -5.61107e+07 (51.09 seconds) After 900 nodes, 72 on tree, -5.27967e+07 best solution, best possible -5.61107e+07 (54.80 seconds) After 1000 nodes, 65 on tree, -5.27967e+07 best solution, best possible -5.61107e+07 (58.25 seconds) After 1100 nodes, 66 on tree, -5.27967e+07 best solution, best possible -5.61107e+07 (61.10 seconds) After 1200 nodes, 66 on tree, -5.27967e+07 best solution, best possible -5.61107e+07 (64.10 seconds) After 1300 nodes, 63 on tree, -5.27967e+07 best solution, best possible -5.61107e+07 (67.63 seconds) After 1400 nodes, 62 on tree, -5.27967e+07 best solution, best possible -5.61107e+07 (70.66 seconds) Integer solution of -5.2814e+07 found after 193707 iterations and 1433 nodes (71.45 seconds) Full problem 1435 rows 6765 columns, reduced to 978 rows 4959 columns - too large After 1500 nodes, 110 on tree, -5.2814e+07 best solution, best possible -5.60603e+07 (75.91 seconds) Integer solution of -5.36923e+07 found after 208662 iterations and 1515 nodes (76.27 seconds) Full problem 1435 rows 6765 columns, reduced to 991 rows 4989 columns - too large After 1600 nodes, 108 on tree, -5.36923e+07 best solution, best possible -5.59434e+07 (83.41 seconds) After 1700 nodes, 152 on tree, -5.36923e+07 best solution, best possible -5.59434e+07 (88.86 seconds) Integer solution of -5.45585e+07 found after 245554 iterations and 1701 nodes (88.90 seconds) Full problem 1435 rows 6765 columns, reduced to 1012 rows 5032 columns - too large After 1800 nodes, 116 on tree, -5.45585e+07 best solution, best possible -5.58135e+07 (94.68 seconds) After 1900 nodes, 119 on tree, -5.45585e+07 best solution, best possible -5.57951e+07 (99.86 seconds) After 2000 nodes, 135 on tree, -5.45585e+07 best solution, best possible -5.55992e+07 (105.15 seconds) After 2100 nodes, 143 on tree, -5.45585e+07 best solution, best possible -5.55029e+07 (111.19 seconds) After 2200 nodes, 149 on tree, -5.45585e+07 best solution, best possible -5.55029e+07 (115.26 seconds) After 2300 nodes, 150 on tree, -5.45585e+07 best solution, best possible -5.55029e+07 (119.16 seconds) After 2400 nodes, 152 on tree, -5.45585e+07 best solution, best possible -5.54244e+07 (123.82 seconds) After 2500 nodes, 147 on tree, -5.45585e+07 best solution, best possible -5.54244e+07 (128.96 seconds) After 2600 nodes, 140 on tree, -5.45585e+07 best solution, best possible -5.5282e+07 (133.18 seconds) After 2700 nodes, 133 on tree, -5.45585e+07 best solution, best possible -5.5282e+07 (136.88 seconds) After 2800 nodes, 129 on tree, -5.45585e+07 best solution, best possible -5.5282e+07 (141.14 seconds) After 2900 nodes, 128 on tree, -5.45585e+07 best solution, best possible -5.5282e+07 (145.99 seconds) After 3000 nodes, 121 on tree, -5.45585e+07 best solution, best possible -5.5282e+07 (150.55 seconds) After 3100 nodes, 112 on tree, -5.45585e+07 best solution, best possible -5.51332e+07 (154.44 seconds) After 3200 nodes, 102 on tree, -5.45585e+07 best solution, best possible -5.51332e+07 (159.54 seconds) After 3300 nodes, 92 on tree, -5.45585e+07 best solution, best possible -5.51332e+07 (164.85 seconds) After 3400 nodes, 78 on tree, -5.45585e+07 best solution, best possible -5.51332e+07 (169.91 seconds) After 3500 nodes, 65 on tree, -5.45585e+07 best solution, best possible -5.5078e+07 (174.68 seconds) After 3600 nodes, 55 on tree, -5.45585e+07 best solution, best possible -5.5078e+07 (180.38 seconds) After 3700 nodes, 46 on tree, -5.45585e+07 best solution, best possible -5.49603e+07 (185.52 seconds) After 3800 nodes, 34 on tree, -5.45585e+07 best solution, best possible -5.49603e+07 (190.76 seconds) After 3900 nodes, 15 on tree, -5.45585e+07 best solution, best possible -5.49603e+07 (195.67 seconds) After 4000 nodes, 2 on tree, -5.45585e+07 best solution, best possible -5.46646e+07 (200.87 seconds) Search completed - best objective -54558535.01422734, took 583432 iterations and 4005 nodes (201.27 seconds) Strong branching done 188 times (3495 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 36, 716 variables fixed on reduced cost Cuts at root node changed objective from -6.2082e+07 to -5.64507e+07 Probing was tried 1024 times and created 22904 cuts of which 5489 were active after adding rounds of cuts (2.824 seconds) Gomory was tried 418 times and created 171 cuts of which 1 were active after adding rounds of cuts (1.364 seconds) Knapsack was tried 20 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.072 seconds) Clique was tried 20 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.020 seconds) MixedIntegerRounding2 was tried 1024 times and created 1199 cuts of which 2 were active after adding rounds of cuts (1.372 seconds) FlowCover was tried 20 times and created 12 cuts of which 0 were active after adding rounds of cuts (1.708 seconds) TwoMirCuts was tried 20 times and created 89 cuts of which 0 were active after adding rounds of cuts (0.132 seconds) implication was tried 1701 times and created 0 cuts of which 0 were active after adding rounds of cuts 931 bounds tightened after postprocessing Result - Finished objective -54558535.01422734 after 4005 nodes and 583432 iterations - took 201.44 seconds (total time 201.58) Total time 202.16 Solved to optimality. MIP solution: -54558535.01 (4005 nodes, 202.17 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/24/08 04:32:07 elapsed 0:03:24.062