Problem 'cplex_3_lp.txt' read.
Read time = 0.01 sec.
CPLEX> opt
Tried aggregator 1 time.
MIP Presolve eliminated 0 rows and 10 columns.
MIP Presolve modified 20513 coefficients.
Reduced MIP has 148 rows, 138 columns, and 10401 nonzeros.
Presolve time = 0.11 sec.
Clique table members: 28.
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 2 1.0000 2
* 0+ 0 1.0000 1.0000 2 0.00%
0 0 cutoff 1.0000 1.0000 2 0.00%
Root node processing (before b&c):
Real time = 0.02
Parallel b&c, 2 threads:
Real time = 0.00
Sync time (average) = 0.00
Wait time (average) = 0.00
-------
Total (root+branch&cut) = 0.02 sec.
Solution pool: 1 solution saved.
MIP - Integer optimal solution: Objective = 1.0000000000e+00
Solution time = 0.13 sec. Iterations = 2 Nodes = 0
CPLEX> dis sol var -
Incumbent solution
Variable Name Solution Value
y0 1.000000
x0 1.000000
x124 1.000000
All other variables in the range 1-148 are 0.