--- Job mas76 Start 07/17/08 19:52:15 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 --- mas76.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/mas76.gdx --- mas76.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.006 --- mas76.gms(123) 4 Mb --- Generating MIP model m --- mas76.gms(124) 4 Mb --- 13 rows 152 columns 1,792 non-zeroes --- 150 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: 151 columns and 12 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 38893.9 - -0.00 seconds processed model has 12 rows, 148 columns (147 integer) and 1615 elements Pass 1: suminf. 0.81725 obj. 41907.2 iterations 14 Pass 2: suminf. 0.00000 obj. 43774.3 iterations 4 Solution found of 43774.3 Cleaned solution of 43774.3 Before mini branch and bound, 135 integers at bound fixed and 0 continuous Full problem 12 rows 148 columns, reduced to 12 rows 13 columns Mini branch and bound improved solution from 43774.3 to 40560.1 (0.03 seconds) Freeing continuous variables gives a solution of 40560.1 Round again with cutoff of 40393.4 Reduced cost fixing fixed 67 variables on major pass 2 Pass 3: suminf. 1.54065 obj. 40393.4 iterations 13 Pass 4: suminf. 1.92031 obj. 40393.4 iterations 14 Pass 5: suminf. 1.92031 obj. 40393.4 iterations 0 Pass 6: suminf. 2.57574 obj. 40393.4 iterations 10 Pass 7: suminf. 1.49972 obj. 40393.4 iterations 15 Pass 8: suminf. 1.97535 obj. 40393.4 iterations 4 Pass 9: suminf. 0.96980 obj. 40393.4 iterations 19 Pass 10: suminf. 0.73203 obj. 40393.4 iterations 9 Pass 11: suminf. 2.23776 obj. 40393.4 iterations 7 Pass 12: suminf. 1.21305 obj. 40393.4 iterations 15 Pass 13: suminf. 1.32931 obj. 40393.4 iterations 7 Pass 14: suminf. 0.40354 obj. 40393.4 iterations 7 Pass 15: suminf. 2.27564 obj. 40393.4 iterations 7 Pass 16: suminf. 0.63766 obj. 40393.4 iterations 7 Pass 17: suminf. 2.49065 obj. 40393.4 iterations 37 Pass 18: suminf. 1.67101 obj. 40393.4 iterations 14 Pass 19: suminf. 1.83368 obj. 40393.4 iterations 22 Pass 20: suminf. 1.40353 obj. 40393.4 iterations 9 Pass 21: suminf. 2.04820 obj. 40393.4 iterations 17 Pass 22: suminf. 1.37350 obj. 40393.4 iterations 7 Before mini branch and bound, 108 integers at bound fixed and 0 continuous Full problem 12 rows 148 columns, reduced to 12 rows 40 columns Mini branch and bound did not improve solution (0.10 seconds) After 0.10 seconds - Feasibility pump exiting with objective of 0 - took 0.10 seconds Integer solution of 43774.3 found by feasibility pump after 0 iterations and 0 nodes (0.11 seconds) Full problem 12 rows 148 columns, reduced to 11 rows 16 columns 9 added rows had average density of 148 At root node, 9 cuts changed objective from 38893.9 to 38974.5 in 9 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.008 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in 0.016 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) - 135 row cuts (6 active), 0 column cuts in 0.020 seconds - new frequency is -100 After 0 nodes, 1 on tree, 43774.3 best solution, best possible 38974.5 (0.50 seconds) Presolve 12 (0) rows, 22 (-126) columns and 207 (-1408) elements Cbc0038I Full problem 12 rows 148 columns, reduced to 11 rows 16 columns Cbc0038I Full problem 12 rows 148 columns, reduced to 12 rows 22 columns Cbc0012I Integer solution of 41066.8 found by combine solutions after 1090 iterations and 172 nodes (1.40 seconds) Cbc0038I Full problem 12 rows 148 columns, reduced to 11 rows 16 columns Cbc0038I Full problem 12 rows 148 columns, reduced to 12 rows 21 columns Cbc0004I Integer solution of 40121.9 found after 32201 iterations and 5980 nodes (5.09 seconds) Cbc0038I Full problem 12 rows 148 columns, reduced to 12 rows 25 columns Cbc0004I Integer solution of 40005.1 found after 152667 iterations and 26431 nodes (14.30 seconds) Cbc0038I Full problem 12 rows 148 columns, reduced to 12 rows 24 columns Cbc0038I Full problem 12 rows 148 columns, reduced to 12 rows 25 columns Solved to optimality. wallclocktime: 254.84 used seconds: 240.64 MIP solution: 40005.05414 (714791 nodes, 240.64 seconds) Best possible: 40005.05414 Absolute gap: 1.4552e-11 (absolute tolerance optca: 0) Relative gap: 3.6375e-16 (relative tolerance optcr: 0) --- Restarting execution --- mas76.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job mas76.gms Stop 07/17/08 19:56:30 elapsed 0:04:14.876