2
$\begingroup$

I know the logical constraints can be linearized by either the logical representation of whose relation, (for pure binary variables e.g. CNF/DNF) or for general form by using Big-M formulation. As I have recently seen there are other methods like convex-hull or cutting-plan transformation to do that in which one can use those and often perform faster than Big-M formulation. I would like to know, is there any simple example of how these methods work and do they implement in the modern solvers?

Improve this question
$\endgroup$
2
  • $\begingroup$ Are looking for something like this: gurobi.com/resources/… (see Cutting planes section). Besides here are more gurobi.com/wp-content/uploads/… $\endgroup$
    – Sutanu
    Mar 12 at 19:19
  • $\begingroup$ @Sutanu, thanks for the comments. But, what I am looking for is based on this paper in which the authors proposed two different methods to solve a GDP. $\endgroup$
    – A.Omidi
    Mar 13 at 5:20

0

Reset to default

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.