Problem 'cplex_5_lp.txt' read. Read time = 0.00 sec. CPLEX> opt Tried aggregator 1 time. MIP Presolve eliminated 0 rows and 1 columns. MIP Presolve modified 7442 coefficients. Reduced MIP has 86 rows, 85 columns, and 4866 nonzeros. Presolve time = 0.02 sec. Clique table members: 5. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 2 threads. Root relaxation solution time = 0.00 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap 0 0 1.0000 8 1.0000 17 0 0 1.0000 7 Cuts: 13 31 0 0 1.0000 8 Cuts: 6 36 0 0 1.0000 9 Cuts: 2 43 * 0+ 0 1.0000 1.0000 43 0.00% 0 0 cutoff 1.0000 1.0000 43 0.00% GUB cover cuts applied: 1 Cover cuts applied: 1 Gomory fractional cuts applied: 1 Root node processing (before b&c): Real time = 0.10 Parallel b&c, 2 threads: Real time = 0.00 Sync time (average) = 0.00 Wait time (average) = 0.00 ------- Total (root+branch&cut) = 0.10 sec. Solution pool: 1 solution saved. MIP - Integer optimal solution: Objective = 1.0000000000e+00 Solution time = 0.12 sec. Iterations = 43 Nodes = 0 CPLEX> dis sol var - Incumbent solution Variable Name Solution Value y0 1.000000 x9 1.000000 x22 1.000000 x39 1.000000 x41 1.000000 All other variables in the range 1-86 are 0.