Strong valid inequalities for orthogonal disjunctions and bilinear covering sets

In this paper, we develop a convexification tool that enables the construction of convex hulls for orthogonal disjunctive sets using convex extensions and disjunctive programming techniques. A distinguishing feature of our technique is that, unlike most applications of disjunctive pro

• Type: Journal
• Year: 2010
• Where: MP
• Authors: Mohit Tawarmalani, Jean-Philippe P. Richard, Kwanghun Chung
• Keywords: Convex Extensions, Disjunctive Programming Techniques, MP 2010, Orthogonal Disjunctive Sets