Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions

This paper develops a technique for generating deep valid inequalities based on combinatorial disjunctions that state that at least p out of some q(≥p) constraints must be satisfied. This technique provides a general framework, which subsumes existing methods, for generating cutting planes based on such disjunctions. It has potential applications, for example, in multiple choice and generalized lattice point programming problems, including mixed-integer zero-one programming problems and the extreme point mathematical programming problem.