--- Job ran10x12 Start 07/18/08 15:09:46 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.006 --- 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.012 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Reading parameter(s) from "/home/stefan/work/gams/benchmarks/LINLib.MIP/cbc.op2" >> threads 2 Finished reading from "/home/stefan/work/gams/benchmarks/LINLib.MIP/cbc.op2" 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 Jul 15 2008 command line - GAMS/CBC -threads 2 -solve -quit threads was changed from 0 to 2 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 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 obj. 2583.44 iterations 30 Pass 3: suminf. 0.58611 obj. 3163.12 iterations 27 Pass 4: suminf. 0.32143 obj. 3052.18 iterations 3 Pass 5: suminf. 0.27378 obj. 3163.12 iterations 5 Pass 6: suminf. 0.21429 obj. 3145.93 iterations 2 Pass 7: suminf. 2.37406 obj. 3163.12 iterations 57 Pass 8: suminf. 2.33715 obj. 3163.12 iterations 23 Pass 9: suminf. 1.17293 obj. 3163.12 iterations 49 Pass 10: suminf. 1.17293 obj. 3163.12 iterations 0 Pass 11: suminf. 0.77536 obj. 3163.12 iterations 43 Pass 12: suminf. 0.54670 obj. 3109.85 iterations 14 Pass 13: suminf. 0.78797 obj. 3163.12 iterations 29 Pass 14: suminf. 1.04199 obj. 3163.12 iterations 47 Pass 15: suminf. 0.99486 obj. 3163.12 iterations 17 Pass 16: suminf. 0.47949 obj. 3163.12 iterations 24 Pass 17: suminf. 0.42719 obj. 3163.12 iterations 22 Pass 18: suminf. 0.47949 obj. 3163.12 iterations 11 Pass 19: suminf. 0.99115 obj. 3163.12 iterations 33 Pass 20: suminf. 0.62682 obj. 3163.12 iterations 21 Pass 21: suminf. 1.15485 obj. 3163.12 iterations 26 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.09 seconds) After 0.09 seconds - Feasibility pump exiting with objective of 3130 - took 0.09 seconds Integer solution of 3130 found by feasibility pump after 0 iterations and 0 nodes (0.09 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.10 seconds) 27 added rows had average density of 74.1111 At root node, 27 cuts changed objective from 2426.22 to 2679.28 in 73 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 1.544 seconds - new frequency is 10 Cut generator 1 (Gomory) - 193 row cuts (8 active), 0 column cuts in 0.084 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 126 row cuts (7 active), 0 column cuts in 0.048 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) - 130 row cuts (2 active), 0 column cuts in 0.016 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 133 row cuts (9 active), 0 column cuts in 0.116 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 203 row cuts (1 active), 0 column cuts in 0.040 seconds - new frequency is -100 After 0 nodes, 1 on tree, 3043 best solution, best possible 2679.28 (2.16 seconds) Cbc0038I Full problem 142 rows 240 columns, reduced to 31 rows 38 columns Cbc0038I Full problem 142 rows 240 columns, reduced to 8 rows 9 columns Cbc0012I Integer solution of 2714 found by combine solutions after 1226 iterations and 11 nodes (2.64 seconds) Solved to optimality. wallclocktime: 2.49179 used seconds: 2.7 MIP solution: 2714 (21 nodes, 2.7 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 07/18/08 15:09:49 elapsed 0:00:02.527