--- Job ran10x12 Start 08/24/08 05:44:08 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 --- 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 Cbc: elapsed 0:00:00.011 GAMS/Cbc 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.20.00, build Aug 23 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 2426.22 - 0.00 seconds Optimal - objective value 2426.22 processed model has 142 rows, 240 columns (120 integer) and 480 elements Pass 1: suminf. 1.05015 (6) obj. 2583.44 iterations 28 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 (6) obj. 2583.44 iterations 30 Pass 3: suminf. 0.58611 (2) obj. 3163.12 iterations 27 Pass 4: suminf. 0.32143 (2) obj. 3052.18 iterations 3 Pass 5: suminf. 0.27378 (1) obj. 3163.12 iterations 5 Pass 6: suminf. 0.21429 (1) obj. 3145.93 iterations 2 Pass 7: suminf. 2.37406 (8) obj. 3163.12 iterations 57 Pass 8: suminf. 2.33715 (9) obj. 3163.12 iterations 23 Pass 9: suminf. 1.17293 (5) obj. 3163.12 iterations 49 Pass 10: suminf. 1.17293 (5) obj. 3163.12 iterations 0 Pass 11: suminf. 0.77536 (3) obj. 3163.12 iterations 43 Pass 12: suminf. 0.54670 (3) obj. 3109.85 iterations 14 Pass 13: suminf. 0.78797 (3) obj. 3163.12 iterations 29 Pass 14: suminf. 1.04199 (5) obj. 3163.12 iterations 47 Pass 15: suminf. 0.99486 (5) obj. 3163.12 iterations 17 Pass 16: suminf. 0.47949 (3) obj. 3163.12 iterations 24 Pass 17: suminf. 0.42719 (4) obj. 3163.12 iterations 22 Pass 18: suminf. 0.47949 (3) obj. 3163.12 iterations 11 Pass 19: suminf. 0.99115 (6) obj. 3163.12 iterations 33 Pass 20: suminf. 0.62682 (4) obj. 3163.12 iterations 21 Pass 21: suminf. 1.15485 (4) obj. 3163.12 iterations 26 No solution found this major pass 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 did not improve solution (0.07 seconds) After 0.07 seconds - Feasibility pump exiting with objective of 3245 - took 0.07 seconds Integer solution of 3245 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Full problem 142 rows 240 columns, reduced to 0 rows 0 columns 20 added rows had average density of 46.7 At root node, 20 cuts changed objective from 2426.22 to 2671.72 in 100 passes Cut generator 0 (Probing) - 0 row cuts, 0 column cuts (0 active) in 1.876 seconds - new frequency is 1000 Cut generator 1 (Gomory) - 2396 row cuts, 0 column cuts (20 active) in 0.144 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 204 row cuts, 0 column cuts (0 active) in 0.064 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 159 row cuts, 0 column cuts (0 active) in 0.024 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 235 row cuts, 0 column cuts (0 active) in 0.100 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 200 row cuts, 0 column cuts (0 active) in 0.036 seconds - new frequency is -100 Optimal - objective value 2671.72 Optimal - objective value 2671.72 After 0 nodes, 1 on tree, 3245 best solution, best possible 2671.72 (2.62 seconds) Full problem 142 rows 240 columns, reduced to 31 rows 38 columns Integer solution of 2714 found by combine solutions after 1632 iterations and 4 nodes (2.80 seconds) Search completed - best objective 2714, took 1789 iterations and 10 nodes (2.86 seconds) Strong branching done 248 times (4270 iterations), fathomed 2 nodes and fixed 13 variables Maximum depth 4, 187 variables fixed on reduced cost Cuts at root node changed objective from 2426.22 to 2671.72 Probing was tried 105 times and created 15 cuts of which 7 were active after adding rounds of cuts (1.880 seconds) Gomory was tried 111 times and created 2405 cuts of which 22 were active after adding rounds of cuts (0.144 seconds) Knapsack was tried 112 times and created 230 cuts of which 4 were active after adding rounds of cuts (0.068 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) MixedIntegerRounding2 was tried 112 times and created 171 cuts of which 8 were active after adding rounds of cuts (0.024 seconds) FlowCover was tried 112 times and created 262 cuts of which 4 were active after adding rounds of cuts (0.108 seconds) TwoMirCuts was tried 100 times and created 200 cuts of which 0 were active after adding rounds of cuts (0.036 seconds) Result - Finished objective 2714 after 10 nodes and 1789 iterations - took 2.86 seconds (total time 2.86) Total time 2.87 Solved to optimality. MIP solution: 2714 (10 nodes, 2.87 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/24/08 05:44:11 elapsed 0:00:02.918