--- Job p0201 Start 08/24/08 05:20:15 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 --- p0201.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/p0201.gdx --- p0201.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.017 --- p0201.gms(123) 4 Mb --- Generating MIP model m --- p0201.gms(124) 4 Mb --- 134 rows 202 columns 2,125 non-zeroes --- 201 discrete-columns --- p0201.gms(124) 4 Mb --- Executing Cbc: elapsed 0:00:00.025 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 201 columns and 133 rows. 201 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 6875 - 0.00 seconds Optimal - objective value 6875 6 fixed, 0 tightened bounds, 18 strengthened rows, 0 substitutions 6 fixed, 0 tightened bounds, 18 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 12 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 8 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 8 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 8 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 8 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 8 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 8 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 6 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 6 strengthened rows, 0 substitutions processed model has 133 rows, 195 columns (195 integer) and 1857 elements Objective coefficients multiple of 5 Cutoff increment increased from 1e-05 to 4.995 Pass 1: suminf. 5.46667 (21) obj. 8241.67 iterations 58 Pass 2: suminf. 5.46667 (21) obj. 8241.67 iterations 0 Pass 3: suminf. 5.46667 (21) obj. 9041.67 iterations 32 Pass 4: suminf. 5.46667 (21) obj. 9041.67 iterations 0 Pass 5: suminf. 5.46667 (21) obj. 9041.67 iterations 21 Pass 6: suminf. 5.46667 (21) obj. 9041.67 iterations 0 Pass 7: suminf. 5.46667 (21) obj. 9041.67 iterations 21 Pass 8: suminf. 0.80000 (4) obj. 9555 iterations 36 Pass 9: suminf. 0.20000 (1) obj. 9725 iterations 17 Solution found of 10685 Before mini branch and bound, 133 integers at bound fixed and 0 continuous Full problem 133 rows 195 columns, reduced to 117 rows 62 columns Mini branch and bound improved solution from 10685 to 8835 (0.05 seconds) Round again with cutoff of 8659.5 Pass 10: suminf. 5.46667 (19) obj. 8258.78 iterations 52 Pass 11: suminf. 5.46667 (19) obj. 8258.78 iterations 0 Pass 12: suminf. 0.29437 (2) obj. 8659.5 iterations 77 Pass 13: suminf. 0.29437 (2) obj. 8659.5 iterations 18 Pass 14: suminf. 0.68750 (2) obj. 8245 iterations 9 Pass 15: suminf. 0.43750 (1) obj. 8445 iterations 9 Pass 16: suminf. 6.68354 (23) obj. 8659.5 iterations 97 Pass 17: suminf. 3.24463 (20) obj. 8659.5 iterations 61 Pass 18: suminf. 2.01478 (28) obj. 8659.5 iterations 22 Pass 19: suminf. 5.68785 (24) obj. 8659.5 iterations 64 Pass 20: suminf. 3.72851 (40) obj. 8659.5 iterations 16 Pass 21: suminf. 5.23063 (21) obj. 8659.5 iterations 45 Pass 22: suminf. 5.00000 (20) obj. 8475 iterations 8 Pass 23: suminf. 5.60907 (22) obj. 8659.5 iterations 47 Pass 24: suminf. 5.40000 (21) obj. 8492.25 iterations 9 Pass 25: suminf. 5.23063 (21) obj. 8659.5 iterations 20 Pass 26: suminf. 6.92381 (31) obj. 8659.5 iterations 58 Pass 27: suminf. 1.24303 (13) obj. 8659.5 iterations 65 Pass 28: suminf. 0.86803 (13) obj. 8659.5 iterations 29 Pass 29: suminf. 5.25415 (16) obj. 8659.5 iterations 51 No solution found this major pass Before mini branch and bound, 97 integers at bound fixed and 0 continuous Full problem 133 rows 195 columns, reduced to 127 rows 98 columns - too large Mini branch and bound did not improve solution (0.10 seconds) After 0.10 seconds - Feasibility pump exiting with objective of 8835 - took 0.10 seconds Integer solution of 8835 found by feasibility pump after 0 iterations and 0 nodes (0.10 seconds) Full problem 133 rows 195 columns, reduced to 4 rows 5 columns Integer solution of 8735 found by combine solutions after 0 iterations and 0 nodes (0.10 seconds) 15 added rows had average density of 80.7333 At root node, 15 cuts changed objective from 7125 to 7374.26 in 100 passes Cut generator 0 (Probing) - 0 row cuts, 0 column cuts (0 active) in 16.441 seconds - new frequency is 1000 Cut generator 1 (Gomory) - 5753 row cuts, 0 column cuts (14 active) in 0.320 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 76 row cuts, 0 column cuts (1 active) in 0.016 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.016 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 518 row cuts, 0 column cuts (0 active) in 0.124 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.020 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 877 row cuts, 0 column cuts (0 active) in 0.128 seconds - new frequency is -100 Optimal - objective value 7374.26 Optimal - objective value 7374.26 After 0 nodes, 1 on tree, 8735 best solution, best possible 7374.26 (17.76 seconds) Full problem 133 rows 195 columns, reduced to 37 rows 21 columns Search completed - best objective 7615, took 6109 iterations and 36 nodes (19.33 seconds) Strong branching done 906 times (31531 iterations), fathomed 11 nodes and fixed 22 variables Maximum depth 12, 872 variables fixed on reduced cost Cuts at root node changed objective from 7125 to 7374.26 Probing was tried 124 times and created 29 cuts of which 8 were active after adding rounds of cuts (16.505 seconds) Gomory was tried 134 times and created 5803 cuts of which 22 were active after adding rounds of cuts (0.364 seconds) Knapsack was tried 100 times and created 76 cuts of which 1 were active after adding rounds of cuts (0.016 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) MixedIntegerRounding2 was tried 134 times and created 629 cuts of which 44 were active after adding rounds of cuts (0.136 seconds) FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.020 seconds) TwoMirCuts was tried 100 times and created 877 cuts of which 0 were active after adding rounds of cuts (0.128 seconds) implication was tried 48 times and created 0 cuts of which 0 were active after adding rounds of cuts Result - Finished objective 7615 after 36 nodes and 6109 iterations - took 19.63 seconds (total time 19.64) Total time 19.65 Solved to optimality. MIP solution: 7615 (36 nodes, 19.65 seconds) Best possible: 7615 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- p0201.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job p0201.gms Stop 08/24/08 05:20:35 elapsed 0:00:19.762