--- Job p0201 Start 07/18/08 15:00:44 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 --- p0201.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/p0201.gdx --- p0201.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.006 --- p0201.gms(123) 4 Mb --- Generating MIP model m --- p0201.gms(124) 4 Mb --- 134 rows 202 columns 2,125 non-zeroes --- 201 discrete-columns --- p0201.gms(124) 4 Mb --- Executing Cbc: elapsed 0:00:00.015 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: 201 columns and 133 rows. 201 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 6875 - -0.00 seconds 6 fixed, 0 tightened bounds, 18 strengthened rows, 0 substitutions 6 fixed, 0 tightened bounds, 18 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 12 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 8 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 8 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 8 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 8 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 8 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 8 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 6 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 6 strengthened rows, 0 substitutions processed model has 133 rows, 195 columns (195 integer) and 1857 elements Objective coefficients multiple of 5 Cutoff increment increased from 1e-05 to 4.995 Pass 1: suminf. 5.70000 obj. 8225 iterations 60 Pass 2: suminf. 5.70000 obj. 8225 iterations 0 Pass 3: suminf. 5.96667 obj. 9291.67 iterations 30 Pass 4: suminf. 5.46667 obj. 9091.67 iterations 1 Pass 5: suminf. 5.70000 obj. 9025 iterations 23 Pass 6: suminf. 3.27143 obj. 9342.52 iterations 32 Pass 7: suminf. 2.77143 obj. 9142.52 iterations 15 Pass 8: suminf. 0.00000 obj. 8885 iterations 35 Solution found of 8885 Before mini branch and bound, 137 integers at bound fixed and 0 continuous Full problem 133 rows 195 columns, reduced to 117 rows 58 columns Mini branch and bound improved solution from 8885 to 8785 (0.06 seconds) Round again with cutoff of 8619 Pass 9: suminf. 5.70000 obj. 8225 iterations 49 Pass 10: suminf. 5.70000 obj. 8225 iterations 0 Pass 11: suminf. 2.25866 obj. 8619 iterations 52 Pass 12: suminf. 2.25866 obj. 8619 iterations 8 Pass 13: suminf. 6.74250 obj. 8619 iterations 32 Pass 14: suminf. 6.50000 obj. 8425 iterations 11 Pass 15: suminf. 6.07583 obj. 8619 iterations 34 Pass 16: suminf. 5.64833 obj. 8619 iterations 9 Pass 17: suminf. 6.19250 obj. 8619 iterations 33 Pass 18: suminf. 5.70000 obj. 8225 iterations 3 Pass 19: suminf. 6.26750 obj. 8619 iterations 54 Pass 20: suminf. 6.12500 obj. 8505 iterations 15 Pass 21: suminf. 6.00000 obj. 8586.67 iterations 26 Pass 22: suminf. 5.64833 obj. 8619 iterations 36 Pass 23: suminf. 6.19250 obj. 8619 iterations 35 Pass 24: suminf. 5.70000 obj. 8225 iterations 7 Pass 25: suminf. 2.25866 obj. 8619 iterations 50 Pass 26: suminf. 2.25866 obj. 8619 iterations 6 Pass 27: suminf. 6.74250 obj. 8619 iterations 41 Pass 28: suminf. 6.50000 obj. 8425 iterations 6 Before mini branch and bound, 137 integers at bound fixed and 0 continuous Full problem 133 rows 195 columns, reduced to 117 rows 58 columns Mini branch and bound did not improve solution (0.14 seconds) After 0.14 seconds - Feasibility pump exiting with objective of 3 - took 0.14 seconds Integer solution of 8885 found by feasibility pump after 0 iterations and 0 nodes (0.14 seconds) Full problem 133 rows 195 columns, reduced to 3 rows 3 columns Integer solution of 8735 found by combine solutions after 0 iterations and 0 nodes (0.14 seconds) 12 added rows had average density of 108.583 At root node, 12 cuts changed objective from 7125 to 7378.84 in 100 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 4.500 seconds - new frequency is 10 Cut generator 1 (Gomory) - 609 row cuts (7 active), 0 column cuts in 0.248 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 95 row cuts (0 active), 0 column cuts in 0.076 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.020 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 494 row cuts (3 active), 0 column cuts in 0.128 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 887 row cuts (2 active), 0 column cuts in 0.156 seconds - new frequency is -100 After 0 nodes, 1 on tree, 8735 best solution, best possible 7378.84 (6.27 seconds) Cbc0038I Full problem 133 rows 195 columns, reduced to 3 rows 3 columns Cbc0038I Full problem 133 rows 195 columns, reduced to 41 rows 23 columns Solved to optimality. wallclocktime: 7.38806 used seconds: 7.8 MIP solution: 7615 (24 nodes, 7.8 seconds) Best possible: 7615 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- p0201.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job p0201.gms Stop 07/18/08 15:00:52 elapsed 0:00:07.429