Currently, I'm working on docplex on python.
I just found out that result from IBM cplex Ilog and docplex is way different.
Even though their constraints, objective function, everything are identical, their solution is very different.
In some cases, docplex says infeasible even though it is feasible in Ilog.
I tried to limit integrality and minimum gap in docplex tolerances but the same problem happens.
Is there anyone have idea why this happens? and how to solve this??
Something must be different between the two versions. You can use refine_conflict to know the source of infeasibility
IBM cplex ilog VS docplex in python