Problem 'cplex_8_lp.txt' read. Read time = 0.01 sec. CPLEX> opt Tried aggregator 1 time. MIP Presolve eliminated 0 rows and 1 columns. MIP Presolve modified 10334 coefficients. Reduced MIP has 144 rows, 143 columns, and 16050 nonzeros. Presolve time = 0.04 sec. Clique table members: 1. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 2 threads. Root relaxation solution time = 0.01 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap 0 0 1.0000 6 1.0000 27 0 0 1.0000 11 Cuts: 18 50 0 0 1.0000 10 Cuts: 10 69 0 2 1.0000 10 1.0000 69 100 67 infeasible 1.0000 968 200 112 infeasible 1.0000 1999 300 173 1.0000 9 1.0000 3194 400 199 1.0000 6 1.0000 4440 500 248 1.0000 7 1.0000 5701 600 251 infeasible 1.0000 7394 700 248 1.0000 9 1.0000 9413 800 244 1.0000 12 1.0000 11161 * 853 215 integral 0 1.0000 1.0000 12069 0.00% GUB cover cuts applied: 3 Cover cuts applied: 123 Gomory fractional cuts applied: 3 Root node processing (before b&c): Real time = 0.44 Parallel b&c, 2 threads: Real time = 1.60 Sync time (average) = 0.08 Wait time (average) = 0.15 ------- Total (root+branch&cut) = 2.05 sec. Solution pool: 1 solution saved. MIP - Integer optimal solution: Objective = 1.0000000000e+00 Solution time = 2.10 sec. Iterations = 12227 Nodes = 863 CPLEX> dis sol var - Incumbent solution Variable Name Solution Value y0 1.000000 x2 1.000000 x5 1.000000 x6 1.000000 x9 1.000000 x36 1.000000 x44 1.000000 x49 1.000000 x77 1.000000 x80 1.000000 x107 1.000000 x119 1.000000 x140 1.000000 x142 1.000000 All other variables in the range 1-144 are 0.