--- Job bal8x12 Start 07/17/08 14:07:24 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 --- bal8x12.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/bal8x12.gdx --- bal8x12.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.030 --- bal8x12.gms(123) 4 Mb --- Generating MIP model m --- bal8x12.gms(124) 4 Mb --- 117 rows 193 columns 577 non-zeroes --- 96 discrete-columns --- Executing Cbc: elapsed 0:00:00.035 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: 192 columns and 116 rows. 96 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 451.188 - 0.00 seconds processed model has 116 rows, 192 columns (96 integer) and 384 elements Pass 1: suminf. 0.93571 obj. 484.429 iterations 43 Pass 2: suminf. 0.53571 obj. 492.429 iterations 13 Solution found of 515.25 Before mini branch and bound, 88 integers at bound fixed and 88 continuous Full problem 116 rows 192 columns, reduced to 8 rows 9 columns Mini branch and bound improved solution from 515.25 to 504.55 (0.01 seconds) Freeing continuous variables gives a solution of 504.55 Round again with cutoff of 499.214 Pass 3: suminf. 1.43571 obj. 475.429 iterations 63 Pass 4: suminf. 0.86905 obj. 482.229 iterations 22 Pass 5: suminf. 0.80734 obj. 499.214 iterations 45 Pass 6: suminf. 1.01127 obj. 499.214 iterations 21 Pass 7: suminf. 1.12899 obj. 499.214 iterations 18 Pass 8: suminf. 1.06575 obj. 499.214 iterations 27 Pass 9: suminf. 1.25399 obj. 499.214 iterations 17 Pass 10: suminf. 1.04901 obj. 499.214 iterations 24 Pass 11: suminf. 1.25399 obj. 499.214 iterations 16 Pass 12: suminf. 2.89095 obj. 499.214 iterations 26 Pass 13: suminf. 2.35277 obj. 499.214 iterations 12 Pass 14: suminf. 1.90024 obj. 499.214 iterations 17 Pass 15: suminf. 2.33310 obj. 499.214 iterations 21 Pass 16: suminf. 2.40329 obj. 499.214 iterations 38 Pass 17: suminf. 1.96944 obj. 499.214 iterations 17 Pass 18: suminf. 1.16552 obj. 499.214 iterations 17 Pass 19: suminf. 1.70801 obj. 499.214 iterations 29 Pass 20: suminf. 1.39919 obj. 499.214 iterations 16 Pass 21: suminf. 1.49746 obj. 499.214 iterations 20 Pass 22: suminf. 1.49746 obj. 499.214 iterations 2 Before mini branch and bound, 68 integers at bound fixed and 74 continuous Full problem 116 rows 192 columns, reduced to 31 rows 39 columns Mini branch and bound improved solution from 504.55 to 496.85 (0.04 seconds) After 0.04 seconds - Feasibility pump exiting with objective of 496.85 - took 0.04 seconds Integer solution of 496.85 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) Full problem 116 rows 192 columns, reduced to 0 rows 0 columns 22 added rows had average density of 60.2727 At root node, 22 cuts changed objective from 451.188 to 470.985 in 16 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.160 seconds - new frequency is 10 Cut generator 1 (Gomory) - 47 row cuts (3 active), 0 column cuts in 0.008 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 53 row cuts (3 active), 0 column cuts in 0.016 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 29 row cuts (5 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 20 row cuts (5 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 173 row cuts (6 active), 0 column cuts in 0.020 seconds - new frequency is -100 After 0 nodes, 1 on tree, 496.85 best solution, best possible 470.985 (0.38 seconds) Cbc0038I Full problem 116 rows 192 columns, reduced to 27 rows 33 columns Cbc0012I Integer solution of 471.55 found by combine solutions after 476 iterations and 13 nodes (0.65 seconds) Solved to optimality. wallclocktime: 0.607954 used seconds: 0.71 MIP solution: 471.55 (18 nodes, 0.71 seconds) Best possible: 471.55 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- bal8x12.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job bal8x12.gms Stop 07/17/08 14:07:25 elapsed 0:00:00.665