论文信息 - Cutting planes from two-term disjunctions

Cutting planes from two-term disjunctions

We consider a polyhedron intersected by a two-term disjunction, and we characterize the polyhedron resulting from taking its closed convex hull. This generalizes an earlier result of Conforti, Wolsey, and Zambelli on split disjunctions. We also recover as a special case the valid inequalities derived by Judice, Sherali, Ribeiro, and Faustino for linear complementarity problems.

Gérard Cornuéjols | Michele Conforti | Marco Molinaro | Giacomo Zambelli | Pierre Bonami

[1] Laurence A. Wolsey,et al. A recursive procedure to generate all cuts for 0–1 mixed integer programs , 1990, Math. Program..

[2] Hanif D. Sherali,et al. A Complementarity-based Partitioning and Disjunctive Cut Algorithm for Mathematical Programming Problems with Equilibrium Constraints , 2006, J. Glob. Optim..