--- Job mod008 Start 07/17/08 21:59:43 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 --- mod008.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/mod008.gdx --- mod008.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.006 --- mod008.gms(123) 4 Mb --- Generating MIP model m --- mod008.gms(124) 4 Mb --- 7 rows 320 columns 1,563 non-zeroes --- 319 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: 319 columns and 6 rows. 319 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 290.931 - -0.00 seconds processed model has 6 rows, 319 columns (319 integer) and 1243 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 0.05050 obj. 310.939 iterations 7 Solution found of 385 Before mini branch and bound, 313 integers at bound fixed and 0 continuous Full problem 6 rows 319 columns, reduced to 5 rows 6 columns Mini branch and bound improved solution from 385 to 308 (0.01 seconds) Round again with cutoff of 306.293 Reduced cost fixing fixed 183 variables on major pass 2 Pass 2: suminf. 0.11322 obj. 306.293 iterations 8 Pass 3: suminf. 1.11820 obj. 306.293 iterations 3 Pass 4: suminf. 0.56958 obj. 306.293 iterations 3 Pass 5: suminf. 0.45743 obj. 306.293 iterations 8 Pass 6: suminf. 0.30701 obj. 306.293 iterations 2 Pass 7: suminf. 1.57124 obj. 306.293 iterations 4 Pass 8: suminf. 0.74823 obj. 306.293 iterations 5 Pass 9: suminf. 0.40695 obj. 306.293 iterations 5 Pass 10: suminf. 0.01122 obj. 306.293 iterations 3 Pass 11: suminf. 0.23268 obj. 302.883 iterations 3 Pass 12: suminf. 1.69605 obj. 306.293 iterations 15 Pass 13: suminf. 0.77211 obj. 306.293 iterations 3 Pass 14: suminf. 1.42309 obj. 306.293 iterations 7 Pass 15: suminf. 1.00167 obj. 306.293 iterations 7 Pass 16: suminf. 0.69234 obj. 306.293 iterations 2 Pass 17: suminf. 0.61785 obj. 306.293 iterations 2 Pass 18: suminf. 0.99363 obj. 306.293 iterations 6 Pass 19: suminf. 0.76699 obj. 306.293 iterations 3 Pass 20: suminf. 1.37428 obj. 306.293 iterations 7 Pass 21: suminf. 0.30842 obj. 303.736 iterations 6 Before mini branch and bound, 292 integers at bound fixed and 0 continuous Full problem 6 rows 319 columns, reduced to 6 rows 27 columns Mini branch and bound did not improve solution (0.04 seconds) After 0.04 seconds - Feasibility pump exiting with objective of 1 - took 0.04 seconds Integer solution of 385 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) Full problem 6 rows 319 columns, reduced to 5 rows 7 columns Integer solution of 367 found by combine solutions after 0 iterations and 0 nodes (0.04 seconds) Integer solution of 361 found by combine solutions after 1808 iterations and 0 nodes (3.81 seconds) 16 added rows had average density of 248.875 At root node, 16 cuts changed objective from 290.931 to 301.849 in 100 passes Cut generator 0 (Probing) - 8 row cuts (0 active), 0 column cuts in 3.252 seconds - new frequency is 4 Cut generator 1 (Gomory) - 572 row cuts (6 active), 0 column cuts in 0.120 seconds - new frequency is 1 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.008 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 420 row cuts (10 active), 0 column cuts in 0.128 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 83 row cuts (0 active), 0 column cuts in 0.024 seconds - new frequency is -100 After 0 nodes, 1 on tree, 361 best solution, best possible 301.849 (3.84 seconds) Cbc0038I Full problem 6 rows 319 columns, reduced to 6 rows 10 columns Cbc0012I Integer solution of 360 found by combine solutions after 1816 iterations and 1 nodes (3.86 seconds) Cbc0038I Full problem 6 rows 319 columns, reduced to 6 rows 10 columns Cbc0012I Integer solution of 359 found by combine solutions after 1818 iterations and 2 nodes (3.90 seconds) Cbc0012I Integer solution of 358 found by greedy cover after 1891 iterations and 9 nodes (3.96 seconds) Cbc0012I Integer solution of 347 found by greedy cover after 1906 iterations and 12 nodes (3.98 seconds) Cbc0038I Full problem 6 rows 319 columns, reduced to 6 rows 17 columns Cbc0038I Full problem 6 rows 319 columns, reduced to 6 rows 14 columns Cbc0012I Integer solution of 319 found by greedy cover after 1900 iterations and 11 nodes (4.10 seconds) Cbc0038I Full problem 6 rows 319 columns, reduced to 6 rows 20 columns Cbc0012I Integer solution of 308 found by combine solutions after 1942 iterations and 14 nodes (4.24 seconds) Cbc0038I Full problem 6 rows 319 columns, reduced to 6 rows 14 columns Cbc0012I Integer solution of 307 found by greedy cover after 2441 iterations and 52 nodes (4.34 seconds) Cbc0038I Full problem 6 rows 319 columns, reduced to 6 rows 16 columns Solved to optimality. wallclocktime: 4.90135 used seconds: 5.59 MIP solution: 307 (1237 nodes, 5.59 seconds) Best possible: 307 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- mod008.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job mod008.gms Stop 07/17/08 21:59:48 elapsed 0:00:04.937