Originally posted by: SystemAdmin
Thanks, Daniel, for a clear and detailed answer. There's still a problem, though -- what you proposed results in CPLEX throwing error 1217 (no solution exists).
I'm trying to use a heuristic callback to "polish" incumbents that are suboptimal. At the root node, CPLEX finds an incumbent (I'm pretty sure via a heuristic) and calls my incumbent callback. The incumbent callback records the solution information (including a value of 0.0 for a variable named "x_0_2") and sets a flag telling the heuristic callback to polish it. When the heuristic callback starts checking feasibilities, it finds the following:
x_0_0 feasbility = ImpliedIntegerFeasible
x_0_1 feasbility = IntegerFeasible
x_0_2 CPLEX Error 1217: No solution exists.
Does this mean that x_0_2 was presolved out? (And should I treat x_0_0 as not presolved out, since the feasibility is implied integer rather than implied?)
Thanks,
Paul
Mathematicians are like Frenchmen: whenever you say something to them, they translate it into their own language, and at once it is something entirely different. (Goethe)
#CPLEXOptimizers#DecisionOptimization