Hello everyone,
I would highly appreciate it if anyone can help me understand the behavior of CPLEX (which is incorrect as I see it) in the following case:
We have two ILPs
original.lp and
modified.lp (attached) to solve a given minimization problem (all variables are binary). The latter is a copy of the former except that some variables were fixed to 1 (by adding the constraints Z1 through Z22 to
modified.lp). In other words, the solution search space of
modified.lp is a subset of the solution search space of
original.lp. Yet,
modified.lp achieves a better solution than
original.lp (27 compared to 32) when solved using CPLEX.
How could this happen?------------------------------
Hisham Almasaeid
------------------------------
#DecisionOptimization