--- Job mas74 Start 07/17/08 19:46:21 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 --- mas74.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/mas74.gdx --- mas74.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.018 --- mas74.gms(123) 4 Mb --- Generating MIP model m --- mas74.gms(124) 4 Mb --- 14 rows 152 columns 1,858 non-zeroes --- 150 discrete-columns --- Executing Cbc: elapsed 0:00:00.024 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: 151 columns and 13 rows. 150 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 10482.8 - 0.00 seconds processed model has 13 rows, 148 columns (147 integer) and 1682 elements Pass 1: suminf. 1.05696 obj. 11417.2 iterations 19 Pass 2: suminf. 1.00000 obj. 11447.3 iterations 1 Pass 3: suminf. 0.00000 obj. 38697.3 iterations 10 Solution found of 38697.3 Cleaned solution of 38697.3 Before mini branch and bound, 133 integers at bound fixed and 0 continuous Full problem 13 rows 148 columns, reduced to 13 rows 15 columns Mini branch and bound improved solution from 38697.3 to 14388.5 (0.05 seconds) Round again with cutoff of 13997.9 Reduced cost fixing fixed 6 variables on major pass 2 Pass 4: suminf. 1.52309 obj. 11634.5 iterations 19 Pass 5: suminf. 0.13811 obj. 13997.9 iterations 8 Pass 6: suminf. 1.00000 obj. 13997.9 iterations 5 Pass 7: suminf. 1.00000 obj. 13997.9 iterations 4 Pass 8: suminf. 2.88494 obj. 13997.9 iterations 24 Pass 9: suminf. 2.15950 obj. 13997.9 iterations 7 Pass 10: suminf. 1.99596 obj. 13997.9 iterations 2 Pass 11: suminf. 2.71180 obj. 13997.9 iterations 14 Pass 12: suminf. 1.44438 obj. 13997.9 iterations 13 Pass 13: suminf. 2.27643 obj. 13997.9 iterations 7 Pass 14: suminf. 1.00000 obj. 13997.9 iterations 12 Pass 15: suminf. 1.00000 obj. 13997.9 iterations 1 Pass 16: suminf. 2.77066 obj. 13997.9 iterations 37 Pass 17: suminf. 1.53012 obj. 13997.9 iterations 16 Pass 18: suminf. 1.67311 obj. 13997.9 iterations 15 Pass 19: suminf. 1.67311 obj. 13997.9 iterations 0 Pass 20: suminf. 2.27428 obj. 13997.9 iterations 10 Pass 21: suminf. 1.19150 obj. 13997.9 iterations 17 Pass 22: suminf. 1.05686 obj. 13997.9 iterations 6 Pass 23: suminf. 1.00000 obj. 13997.9 iterations 1 Before mini branch and bound, 94 integers at bound fixed and 0 continuous Full problem 13 rows 148 columns, reduced to 13 rows 54 columns Mini branch and bound improved solution from 14388.5 to 13616.5 (0.15 seconds) Freeing continuous variables gives a solution of 13616.5 After 0.15 seconds - Feasibility pump exiting with objective of 13616.5 - took 0.15 seconds Integer solution of 13616.5 found by feasibility pump after 0 iterations and 0 nodes (0.15 seconds) Full problem 13 rows 148 columns, reduced to 12 rows 21 columns 10 added rows had average density of 148 At root node, 10 cuts changed objective from 10482.8 to 10589 in 10 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.304 seconds - new frequency is 10 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.016 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 133 row cuts (4 active), 0 column cuts in 0.012 seconds - new frequency is -100 After 0 nodes, 1 on tree, 13616.5 best solution, best possible 10589 (0.56 seconds) After 1000 nodes, 99 on tree, 13616.5 best solution, best possible 10590.9 (2.27 seconds) Cbc0004I Integer solution of 13336.7 found after 8002 iterations and 1686 nodes (2.63 seconds) Cbc0038I Full problem 13 rows 148 columns, reduced to 13 rows 31 columns Cbc0038I Full problem 13 rows 148 columns, reduced to 12 rows 21 columns Cbc0004I Integer solution of 12007.4 found after 32296 iterations and 5941 nodes (6.54 seconds) Cbc0038I Full problem 13 rows 148 columns, reduced to 12 rows 21 columns Cbc0038I Full problem 13 rows 148 columns, reduced to 13 rows 34 columns Cbc0038I Full problem 13 rows 148 columns, reduced to 12 rows 21 columns Cbc0038I Full problem 13 rows 148 columns, reduced to 13 rows 41 columns Node limit reached. Have feasible solution. wallclocktime: 354.082 used seconds: 448.91 MIP solution: 11801.18573 (999999 nodes, 448.91 seconds) Best possible: 11279.80263 Absolute gap: 521.38 (absolute tolerance optca: 0) Relative gap: 0.046223 (relative tolerance optcr: 0) --- Restarting execution --- mas74.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job mas74.gms Stop 07/17/08 19:52:15 elapsed 0:05:54.134