--- Job mod010 Start 08/21/08 23:29:10 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 --- mod010.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/mod010.gdx --- mod010.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.014 --- mod010.gms(123) 4 Mb --- Generating MIP model m --- mod010.gms(124) 5 Mb --- 147 rows 2,656 columns 13,859 non-zeroes --- 2,655 discrete-columns --- mod010.gms(124) 5 Mb --- Executing COINCBC: elapsed 0:00:00.052 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 2655 columns and 146 rows. 2655 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 6532.08 - 0.05 seconds 27 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 83 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 144 rows, 2572 columns (2572 integer) and 10760 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 4.00000 obj. 6690.6 iterations 138 Pass 2: suminf. 1.00000 obj. 6758.38 iterations 133 Solution found of 7048 Before mini branch and bound, 2520 integers at bound fixed and 0 continuous Full problem 144 rows 2572 columns, reduced to 14 rows 18 columns Mini branch and bound improved solution from 7048 to 6548 (0.06 seconds) Round again with cutoff of 6546.41 Reduced cost fixing fixed 2009 variables on major pass 2 Pass 3: suminf. 1.49219 obj. 6546.41 iterations 99 Pass 4: suminf. 1.32639 obj. 6546.41 iterations 49 Pass 5: suminf. 9.90909 obj. 6544.5 iterations 78 Pass 6: suminf. 9.90909 obj. 6544.5 iterations 32 Pass 7: suminf. 6.34576 obj. 6546.41 iterations 38 Pass 8: suminf. 6.34576 obj. 6546.41 iterations 22 Pass 9: suminf. 7.16515 obj. 6546.41 iterations 67 Pass 10: suminf. 6.90909 obj. 6545 iterations 41 Pass 11: suminf. 6.90909 obj. 6545 iterations 28 Pass 12: suminf. 8.09205 obj. 6546.41 iterations 78 Pass 13: suminf. 6.39767 obj. 6546.41 iterations 80 Pass 14: suminf. 6.34576 obj. 6546.41 iterations 9 Pass 15: suminf. 6.24935 obj. 6546.41 iterations 11 Pass 16: suminf. 6.61481 obj. 6546.41 iterations 35 Pass 17: suminf. 6.34576 obj. 6546.41 iterations 19 Pass 18: suminf. 7.33030 obj. 6546.41 iterations 54 Pass 19: suminf. 6.59762 obj. 6546.41 iterations 53 Pass 20: suminf. 7.00000 obj. 6545 iterations 41 Pass 21: suminf. 7.00000 obj. 6545 iterations 18 Pass 22: suminf. 6.00000 obj. 6546 iterations 28 Before mini branch and bound, 2492 integers at bound fixed and 0 continuous Full problem 144 rows 2572 columns, reduced to 38 rows 59 columns Mini branch and bound did not improve solution (0.20 seconds) After 0.20 seconds - Feasibility pump exiting with objective of 8 - took 0.20 seconds Integer solution of 7048 found by feasibility pump after 0 iterations and 0 nodes (0.20 seconds) Full problem 144 rows 2572 columns, reduced to 0 rows 0 columns Full problem 144 rows 2572 columns, reduced to 51 rows 362 columns Integer solution of 6548 found by greedy equality after 0 iterations and 0 nodes (0.30 seconds) 1 added rows had average density of 22 At root node, 65 cuts changed objective from 6532.08 to 6558 in 2 passes Cut generator 0 (Probing) - 67 row cuts (65 active), 67 column cuts in 0.004 seconds - new frequency is 1 Cut generator 1 (Gomory) - 39 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in 0.004 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) - 2 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Search completed - best objective 6548, took 69 iterations and 0 nodes (0.36 seconds) Maximum depth 0, 2361 variables fixed on reduced cost Cuts at root node changed objective from 6532.08 to 6558 Probing was tried 2 times and created 67 cuts of which 65 were active after adding rounds of cuts (0.004 seconds) Gomory was tried 2 times and created 39 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) Knapsack was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) Clique was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) FlowCover was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) TwoMirCuts was tried 2 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) Result - Finished objective 6548 after 0 nodes and 69 iterations - took 0.79 seconds (total time 0.84) Total time 0.85 Solved to optimality. MIP solution: 6548 (0 nodes, 0.86 seconds) Best possible: 6548 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- mod010.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job mod010.gms Stop 08/21/08 23:29:11 elapsed 0:00:00.970