--- Job p2756 Start 08/22/08 01:34:39 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 --- p2756.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/p2756.gdx --- p2756.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.016 --- p2756.gms(123) 4 Mb --- Generating MIP model m --- p2756.gms(124) 5 Mb --- 756 rows 2,757 columns 11,104 non-zeroes --- 2,756 discrete-columns --- p2756.gms(124) 5 Mb --- Executing COINCBC: elapsed 0:00:00.053 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 2756 columns and 755 rows. 2756 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 2688.75 - 0.01 seconds 23 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 23 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 710 rows, 2620 columns (2620 integer) and 8287 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 2.64206 obj. 2705.12 iterations 12 Pass 2: suminf. 0.86010 obj. 5691.88 iterations 31 Pass 3: suminf. 0.60902 obj. 5691.06 iterations 2 Pass 4: suminf. 0.44952 obj. 5935 iterations 5 Pass 5: suminf. 0.20134 obj. 5935 iterations 1 Pass 6: suminf. 0.71615 obj. 5935 iterations 4 Pass 7: suminf. 0.46797 obj. 5935 iterations 1 Pass 8: suminf. 8.12790 obj. 62473.3 iterations 448 Pass 9: suminf. 8.03201 obj. 62430.1 iterations 25 Pass 10: suminf. 4.96627 obj. 71788.5 iterations 12 Pass 11: suminf. 4.96627 obj. 71788.5 iterations 0 Pass 12: suminf. 3.25351 obj. 81960.9 iterations 15 Pass 13: suminf. 3.25351 obj. 81960.9 iterations 0 Pass 14: suminf. 0.78796 obj. 115821 iterations 26 Pass 15: suminf. 0.24560 obj. 117747 iterations 17 Pass 16: suminf. 0.44179 obj. 117747 iterations 15 Pass 17: suminf. 0.83577 obj. 117747 iterations 22 Pass 18: suminf. 0.35153 obj. 117747 iterations 18 Pass 19: suminf. 0.24507 obj. 117747 iterations 11 Pass 20: suminf. 0.87953 obj. 117747 iterations 19 No solution found this major pass Before mini branch and bound, 2188 integers at bound fixed and 0 continuous Mini branch and bound did not improve solution (0.07 seconds) After 0.07 seconds - Feasibility pump exiting - took 0.07 seconds 206 added rows had average density of 14.9515 At root node, 206 cuts changed objective from 2701.14 to 3115.1 in 10 passes Cut generator 0 (Probing) - 31 row cuts (4 active), 3 column cuts in 0.336 seconds - new frequency is 1 Cut generator 1 (Gomory) - 145 row cuts (14 active), 0 column cuts in 0.028 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 411 row cuts (78 active), 0 column cuts in 0.024 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 67 row cuts (15 active), 0 column cuts in 0.028 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 296 row cuts (95 active), 0 column cuts in 0.036 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 3115.1 (0.65 seconds) After 100 nodes, 51 on tree, 1e+50 best solution, best possible 3119.42 (4.44 seconds) After 200 nodes, 7 on tree, 3127 best solution, best possible 3119.42 (6.85 seconds) Full problem 710 rows 2620 columns, reduced to 0 rows 0 columns Integer solution of 3124 found after 4824 iterations and 205 nodes (6.97 seconds) Search completed - best objective 3124, took 4882 iterations and 207 nodes (6.99 seconds) Strong branching done 1662 times (13795 iterations), fathomed 3 nodes and fixed 4 variables Maximum depth 16, 10440 variables fixed on reduced cost Cuts at root node changed objective from 2701.14 to 3115.1 Probing was tried 209 times and created 528 cuts of which 184 were active after adding rounds of cuts (0.676 seconds) Gomory was tried 208 times and created 601 cuts of which 90 were active after adding rounds of cuts (0.240 seconds) Knapsack was tried 209 times and created 1485 cuts of which 351 were active after adding rounds of cuts (0.400 seconds) Clique was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) MixedIntegerRounding2 was tried 10 times and created 67 cuts of which 15 were active after adding rounds of cuts (0.028 seconds) FlowCover was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) TwoMirCuts was tried 10 times and created 296 cuts of which 95 were active after adding rounds of cuts (0.036 seconds) Result - Finished objective 3124 after 207 nodes and 4882 iterations - took 7.33 seconds (total time 7.34) Total time 7.35 Solved to optimality. MIP solution: 3124 (207 nodes, 7.36 seconds) Best possible: 3124 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- p2756.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job p2756.gms Stop 08/22/08 01:34:47 elapsed 0:00:07.481