Originally posted by: SKSCPLEX
We have observed that CPLEX allows the inclusion of implication constraints over decision variables. However, we are not sure how exactly CPLEX handles such constraints. Does it convert these implication constraints to the traditional <= form using mathematical modelling (as is usually done offline) or does it combine some other technique (along with B&B +cuts) to solve these models ?
And more importantly, can a model with integer variables and implication constraints be termed as MILP for the textbook definition of MILP models require the constraints to be in the <= (or >=) form ?
Thanks !!
#DecisionOptimization#OPLusingCPLEXOptimizer