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?
$\begingroup$ Are looking for something like this: gurobi.com/resources/… (see Cutting planes section). Besides here are more gurobi.com/wp-content/uploads/… $\endgroup$– SutanuMar 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.OmidiMar 13 at 5:20