--- Job p0201 Start 08/22/08 01:34:26 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 --- 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.005 --- 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 COINCBC: elapsed 0:00:00.012 GAMS/CoinCbc 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.10.00, build Jun 21 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 6875 - 0.00 seconds 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 obj. 8241.67 iterations 58 Pass 2: suminf. 5.46667 obj. 8241.67 iterations 0 Pass 3: suminf. 5.46667 obj. 9041.67 iterations 30 Pass 4: suminf. 5.46667 obj. 9041.67 iterations 0 Pass 5: suminf. 5.46667 obj. 9041.67 iterations 29 Pass 6: suminf. 5.46667 obj. 9041.67 iterations 0 Pass 7: suminf. 5.46667 obj. 9041.67 iterations 29 Pass 8: suminf. 0.80000 obj. 9555 iterations 39 Pass 9: suminf. 0.20000 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.06 seconds) Round again with cutoff of 8664 Pass 10: suminf. 5.46667 obj. 8258.78 iterations 52 Pass 11: suminf. 5.46667 obj. 8258.78 iterations 0 Pass 12: suminf. 0.28875 obj. 8664 iterations 70 Pass 13: suminf. 0.28875 obj. 8664 iterations 13 Pass 14: suminf. 0.68750 obj. 8245 iterations 8 Pass 15: suminf. 0.43750 obj. 8445 iterations 4 Pass 16: suminf. 6.71807 obj. 8664 iterations 68 Pass 17: suminf. 3.24337 obj. 8664 iterations 53 Pass 18: suminf. 2.25239 obj. 8664 iterations 20 Pass 19: suminf. 2.00345 obj. 8664 iterations 11 Pass 20: suminf. 6.26394 obj. 8664 iterations 58 Pass 21: suminf. 6.15049 obj. 8664 iterations 14 Pass 22: suminf. 6.89151 obj. 8664 iterations 53 Pass 23: suminf. 5.26721 obj. 8664 iterations 18 Pass 24: suminf. 5.16369 obj. 8664 iterations 20 Pass 25: suminf. 2.72636 obj. 8664 iterations 67 Pass 26: suminf. 1.72996 obj. 8664 iterations 34 Pass 27: suminf. 5.07150 obj. 8664 iterations 61 Pass 28: suminf. 5.05500 obj. 8664 iterations 28 Pass 29: suminf. 0.63875 obj. 8664 iterations 46 Before mini branch and bound, 107 integers at bound fixed and 0 continuous Full problem 133 rows 195 columns, reduced to 123 rows 88 columns - too large Mini branch and bound did not improve solution (0.10 seconds) After 0.10 seconds - Feasibility pump exiting with objective of 1 - took 0.10 seconds Integer solution of 10685 found by feasibility pump after 0 iterations and 0 nodes (0.10 seconds) Full problem 133 rows 195 columns, reduced to 4 rows 9 columns Integer solution of 9785 found by combine solutions after 0 iterations and 0 nodes (0.11 seconds) Integer solution of 9385 found by combine solutions after 2675 iterations and 0 nodes (6.57 seconds) 17 added rows had average density of 117.235 At root node, 17 cuts changed objective from 7125 to 7312.6 in 100 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 5.464 seconds - new frequency is 10 Cut generator 1 (Gomory) - 594 row cuts (7 active), 0 column cuts in 0.348 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 77 row cuts (3 active), 0 column cuts in 0.080 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) - 542 row cuts (3 active), 0 column cuts in 0.116 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 938 row cuts (4 active), 0 column cuts in 0.128 seconds - new frequency is -100 After 0 nodes, 1 on tree, 9385 best solution, best possible 7312.6 (6.92 seconds) Full problem 133 rows 195 columns, reduced to 45 rows 28 columns Search completed - best objective 7615, took 4226 iterations and 30 nodes (7.78 seconds) Strong branching done 700 times (20815 iterations), fathomed 9 nodes and fixed 39 variables Maximum depth 9, 789 variables fixed on reduced cost Cuts at root node changed objective from 7125 to 7312.6 Probing was tried 102 times and created 8 cuts of which 1 were active after adding rounds of cuts (5.468 seconds) Gomory was tried 118 times and created 642 cuts of which 14 were active after adding rounds of cuts (0.352 seconds) Knapsack was tried 100 times and created 77 cuts of which 3 were active after adding rounds of cuts (0.080 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) MixedIntegerRounding2 was tried 118 times and created 663 cuts of which 41 were active after adding rounds of cuts (0.128 seconds) FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) TwoMirCuts was tried 100 times and created 938 cuts of which 4 were active after adding rounds of cuts (0.128 seconds) Result - Finished objective 7615 after 30 nodes and 4226 iterations - took 8.22 seconds (total time 8.23) Total time 8.23 Solved to optimality. MIP solution: 7615 (30 nodes, 8.23 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/22/08 01:34:35 elapsed 0:00:08.285