--- Job ran10x12 Start 08/22/08 01:47:09 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 --- ran10x12.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran10x12.gdx --- ran10x12.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.005 --- ran10x12.gms(123) 4 Mb --- Generating MIP model m --- ran10x12.gms(124) 4 Mb --- 143 rows 241 columns 721 non-zeroes --- 120 discrete-columns --- Executing COINCBC: elapsed 0:00:00.010 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 240 columns and 142 rows. 120 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 2426.22 - 0.00 seconds processed model has 142 rows, 240 columns (120 integer) and 480 elements Pass 1: suminf. 1.05015 obj. 2583.44 iterations 37 Solution found of 3571 Before mini branch and bound, 108 integers at bound fixed and 108 continuous Full problem 142 rows 240 columns, reduced to 14 rows 16 columns Mini branch and bound improved solution from 3571 to 3245 (0.01 seconds) Round again with cutoff of 3163.12 Pass 2: suminf. 1.05015 obj. 2583.44 iterations 25 Pass 3: suminf. 0.58611 obj. 3163.12 iterations 31 Pass 4: suminf. 0.32143 obj. 3052.18 iterations 4 Pass 5: suminf. 0.27378 obj. 3163.12 iterations 8 Pass 6: suminf. 0.21429 obj. 3145.93 iterations 4 Pass 7: suminf. 2.37406 obj. 3163.12 iterations 56 Pass 8: suminf. 2.33715 obj. 3163.12 iterations 21 Pass 9: suminf. 1.17293 obj. 3163.12 iterations 57 Pass 10: suminf. 1.17293 obj. 3163.12 iterations 0 Pass 11: suminf. 0.77536 obj. 3163.12 iterations 36 Pass 12: suminf. 0.54670 obj. 3109.85 iterations 12 Pass 13: suminf. 0.78797 obj. 3163.12 iterations 31 Pass 14: suminf. 1.04199 obj. 3163.12 iterations 46 Pass 15: suminf. 0.99486 obj. 3163.12 iterations 18 Pass 16: suminf. 0.47949 obj. 3163.12 iterations 19 Pass 17: suminf. 0.42719 obj. 3163.12 iterations 18 Pass 18: suminf. 0.47949 obj. 3163.12 iterations 18 Pass 19: suminf. 0.99115 obj. 3163.12 iterations 22 Pass 20: suminf. 0.62682 obj. 3163.12 iterations 20 Pass 21: suminf. 1.15485 obj. 3163.12 iterations 33 Before mini branch and bound, 89 integers at bound fixed and 86 continuous Full problem 142 rows 240 columns, reduced to 40 rows 55 columns Mini branch and bound improved solution from 3245 to 3130 (0.06 seconds) After 0.06 seconds - Feasibility pump exiting with objective of 3130 - took 0.06 seconds Integer solution of 3130 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) Full problem 142 rows 240 columns, reduced to 8 rows 9 columns Integer solution of 3043 found by combine solutions after 0 iterations and 0 nodes (0.07 seconds) 25 added rows had average density of 71.16 At root node, 25 cuts changed objective from 2426.22 to 2672.96 in 100 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 2.144 seconds - new frequency is 10 Cut generator 1 (Gomory) - 208 row cuts (7 active), 0 column cuts in 0.124 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 131 row cuts (8 active), 0 column cuts in 0.068 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) - 161 row cuts (2 active), 0 column cuts in 0.032 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 186 row cuts (8 active), 0 column cuts in 0.132 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 207 row cuts (0 active), 0 column cuts in 0.036 seconds - new frequency is -100 After 0 nodes, 1 on tree, 3043 best solution, best possible 2672.96 (2.86 seconds) Full problem 142 rows 240 columns, reduced to 31 rows 38 columns Integer solution of 2714 found by combine solutions after 1455 iterations and 7 nodes (3.18 seconds) Search completed - best objective 2714, took 1689 iterations and 14 nodes (3.22 seconds) Strong branching done 336 times (6105 iterations), fathomed 2 nodes and fixed 3 variables Maximum depth 6, 341 variables fixed on reduced cost Cuts at root node changed objective from 2426.22 to 2672.96 Probing was tried 101 times and created 1 cuts of which 0 were active after adding rounds of cuts (2.144 seconds) Gomory was tried 110 times and created 214 cuts of which 9 were active after adding rounds of cuts (0.136 seconds) Knapsack was tried 111 times and created 146 cuts of which 11 were active after adding rounds of cuts (0.076 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 111 times and created 177 cuts of which 8 were active after adding rounds of cuts (0.032 seconds) FlowCover was tried 111 times and created 212 cuts of which 14 were active after adding rounds of cuts (0.144 seconds) TwoMirCuts was tried 100 times and created 207 cuts of which 0 were active after adding rounds of cuts (0.036 seconds) Result - Finished objective 2714 after 14 nodes and 1689 iterations - took 3.22 seconds (total time 3.23) Total time 3.23 Solved to optimality. MIP solution: 2714 (14 nodes, 3.23 seconds) Best possible: 2714 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- ran10x12.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran10x12.gms Stop 08/22/08 01:47:12 elapsed 0:00:03.284