Problem 'cplex_1_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 36 coefficients. Reduced MIP has 36 rows, 35 columns, and 1260 nonzeros. Presolve time = 0.00 sec. Clique table members: 358. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 2 threads. Root relaxation solution time = 0.04 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap * 0 0 integral 0 1.0000 1.0000 2 0.00% Root node processing (before b&c): Real time = 0.04 Parallel b&c, 2 threads: Real time = 0.00 Sync time (average) = 0.00 Wait time (average) = 0.00 ------- Total (root+branch&cut) = 0.04 sec. Solution pool: 1 solution saved. MIP - Integer optimal solution: Objective = 1.0000000000e+00 Solution time = 0.05 sec. Iterations = 2 Nodes = 0 CPLEX> dis sol var - Incumbent solution Variable Name Solution Value y0 1.000000 x0 1.000000 x4 1.000000 All other variables in the range 1-36 are 0.