Problem 'cplex_6_lp.txt' read. Read time = 0.01 sec. CPLEX> opt Tried aggregator 1 time. MIP Presolve eliminated 0 rows and 5 columns. MIP Presolve modified 5617 coefficients. Reduced MIP has 146 rows, 141 columns, and 17057 nonzeros. Presolve time = 0.04 sec. Clique table members: 10. 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 8 1.0000 21 0 0 1.0000 7 Cuts: 61 38 0 0 1.0000 4 Cuts: 38 63 0 0 1.0000 9 Cuts: 5 72 0 0 1.0000 9 Covers: 3 74 0 2 1.0000 9 1.0000 74 * 66+ 22 1.0000 1.0000 1665 0.00% GUB cover cuts applied: 8 Clique cuts applied: 1 Cover cuts applied: 35 Root node processing (before b&c): Real time = 0.47 Parallel b&c, 2 threads: Real time = 0.13 Sync time (average) = 0.01 Wait time (average) = 0.02 ------- Total (root+branch&cut) = 0.60 sec. Solution pool: 1 solution saved. MIP - Integer optimal solution: Objective = 1.0000000000e+00 Solution time = 0.66 sec. Iterations = 1867 Nodes = 71 CPLEX> dis sol var - Incumbent solution Variable Name Solution Value y0 1.000000 x29 1.000000 x92 1.000000 x108 1.000000 x117 1.000000 x124 1.000000 x140 1.000000 x142 1.000000 All other variables in the range 1-146 are 0.