--- Job n370d Start 07/18/08 11:14:04 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 --- n370d.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/n370d.gdx --- n370d.gms(148) 5 Mb --- Starting execution: elapsed 0:00:00.096 --- n370d.gms(123) 5 Mb --- Generating MIP model m --- n370d.gms(124) 7 Mb --- 5,151 rows 10,001 columns 30,001 non-zeroes --- 5,000 discrete-columns --- n370d.gms(124) 7 Mb --- Executing Cbc: elapsed 0:00:00.234 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: 10000 columns and 5150 rows. 5000 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 965431 - 1.83 seconds processed model has 5150 rows, 10000 columns (5000 integer) and 20000 elements Pass 1: (0.29 seconds) suminf. 6.78883 obj. 1.04387e+06 iterations 1238 Pass 2: (0.32 seconds) suminf. 6.62199 obj. 1.04476e+06 iterations 33 Pass 3: (0.56 seconds) suminf. 1.30391 obj. 1.28526e+06 iterations 1350 Pass 4: (0.77 seconds) suminf. 0.06737 obj. 1.53176e+06 iterations 1271 Pass 5: (0.96 seconds) suminf. 0.00060 obj. 1.63055e+06 iterations 1099 Pass 6: (0.99 seconds) suminf. 0.00060 obj. 1.63055e+06 iterations 0 Pass 7: (1.38 seconds) suminf. 0.13433 obj. 7.40341e+06 iterations 2605 Solution found of 7.42156e+06 Before mini branch and bound, 4503 integers at bound fixed and 4734 continuous Full problem 5150 rows 10000 columns, reduced to 304 rows 443 columns Mini branch and bound did not improve solution (2.23 seconds) After 2.23 seconds - Feasibility pump exiting with objective of 1 - took 2.21 seconds Integer solution of 1.64424e+06 found by feasibility pump after 0 iterations and 0 nodes (3.35 seconds) Full problem 5150 rows 10000 columns, reduced to 22 rows 24 columns Integer solution of 1.62393e+06 found by combine solutions after 0 iterations and 0 nodes (5.19 seconds) 281 added rows had average density of 125.769 At root node, 281 cuts changed objective from 965431 to 1.03222e+06 in 20 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 2.844 seconds - new frequency is 10 Cut generator 1 (Gomory) - 24 row cuts (0 active), 0 column cuts in 1.120 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 305 row cuts (27 active), 0 column cuts in 0.328 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.040 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 668 row cuts (182 active), 0 column cuts in 0.196 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 459 row cuts (67 active), 0 column cuts in 0.456 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 63 row cuts (5 active), 0 column cuts in 0.804 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1.62393e+06 best solution, best possible 1.03222e+06 (27.58 seconds) After 100 nodes, 52 on tree, 1.62393e+06 best solution, best possible 1.03417e+06 (430.20 seconds) After 200 nodes, 110 on tree, 1.62393e+06 best solution, best possible 1.03425e+06 (668.36 seconds) After 300 nodes, 166 on tree, 1.62393e+06 best solution, best possible 1.03425e+06 (824.06 seconds) After 400 nodes, 220 on tree, 1.62393e+06 best solution, best possible 1.03425e+06 (925.21 seconds) After 500 nodes, 276 on tree, 1.62393e+06 best solution, best possible 1.03425e+06 (975.58 seconds) After 600 nodes, 332 on tree, 1.62393e+06 best solution, best possible 1.03425e+06 (1002.47 seconds) After 700 nodes, 391 on tree, 1.62393e+06 best solution, best possible 1.03425e+06 (1022.56 seconds) After 800 nodes, 450 on tree, 1.62393e+06 best solution, best possible 1.03425e+06 (1040.34 seconds) 1780 Obj 1.43873e+06 Primal inf 538.358 (26) 1958 Obj 1.44434e+06 Primal inf 3130.02 (28) 2136 Obj 1.44994e+06 Primal inf 1025.63 (21) 2314 Obj 1.45759e+06 Primal inf 242.402 (13) 2492 Obj 1.46567e+06 Primal inf 267.923 (14) 2670 Obj 1.46601e+06 Primal inf 126.926 (13) 2848 Obj 1.47039e+06 Primal inf 547.671 (14) 3026 Obj 1.47081e+06 Primal inf 109.005 (9) 3204 Obj 1.48152e+06 Primal inf 182.09 (5) 3343 Obj 1.48196e+06 Optimal - objective value 1.48196e+06 Cbc0038I Full problem 5150 rows 10000 columns, reduced to 292 rows 387 columns Cbc0038I Full problem 5150 rows 10000 columns, reduced to 292 rows 387 columns Cbc0012I Integer solution of 1.47618e+06 found by combine solutions after 191354 iterations and 834 nodes (1051.93 seconds) Cbc0012I Integer solution of 1.47794e+06 found by combine solutions after 191291 iterations and 835 nodes (1052.54 seconds) Cbc0012I Integer solution of 1.47457e+06 found by combine solutions after 191450 iterations and 836 nodes (1053.88 seconds) Cbc0012I Integer solution of 1.4561e+06 found by combine solutions after 191553 iterations and 838 nodes (1055.83 seconds) Node limit reached. Have feasible solution. wallclocktime: 3656.63 used seconds: 7165.3 MIP solution: 1456099 (18482 nodes, 7165.31 seconds) Best possible: 1038760.495 Absolute gap: 4.1734e+05 (absolute tolerance optca: 0) Relative gap: 0.40177 (relative tolerance optcr: 0) --- Restarting execution --- n370d.gms(124) 0 Mb --- Reading solution for model m --- n370d.gms(124) 5 Mb *** Status: Normal completion --- Job n370d.gms Stop 07/18/08 12:15:01 elapsed 1:00:56.953