Problem 'cplex_2_lp.txt' read. Read time = 0.00 sec. CPLEX> opt Tried aggregator 1 time. MIP Presolve eliminated 0 rows and 4 columns. MIP Presolve modified 7106 coefficients. Reduced MIP has 86 rows, 82 columns, and 4624 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 6 1.0000 10 0 0 1.0000 6 Cuts: 27 46 0 0 1.0000 9 GUBcuts: 1 50 * 0+ 0 1.0000 1.0000 50 0.00% 0 0 cutoff 1.0000 1.0000 50 0.00% GUB cover cuts applied: 2 Root node processing (before b&c): Real time = 0.03 Parallel b&c, 2 threads: Real time = 0.00 Sync time (average) = 0.00 Wait time (average) = 0.00 ------- Total (root+branch&cut) = 0.03 sec. Solution pool: 1 solution saved. MIP - Integer optimal solution: Objective = 1.0000000000e+00 Solution time = 0.06 sec. Iterations = 50 Nodes = 0 CPLEX> dis sol var - Incumbent solution Variable Name Solution Value y0 1.000000 x10 1.000000 x31 1.000000 x63 1.000000 x69 1.000000 x76 1.000000 All other variables in the range 1-86 are 0.