Optimization Online


Monoidal Cut Strengthening and Generalized Mixed-Integer Rounding for Disjunctions and Complementarity Constraints

Tobias Fischer (tfischer***at***mathematik.tu-darmstadt.de)
Marc E. Pfetsch (pfetsch***at***mathematik.tu-darmstadt.de)

Abstract: In the early 1980s, Balas and Jeroslow presented monoidal disjunctive cuts exploiting the integrality of variables. This article investigates the relation of monoidal cut strengthening to other classes of cutting planes for general two-term disjunctions. We introduce a generalization of mixed-integer rounding cuts and show equivalence to monoidal disjunctive cuts. Moreover, we demonstrate the effectiveness of these cuts via computational experiments on instances involving complementarity constraints. Finally, we present an adaptation of the mixed-integer rounding approach for mixed-complementarity problems.

Keywords: Disjunctive Cuts, Monoidal Cut Strengthening, Mixed-Integer Rounding, Complementarity Constraints

Category 1: Integer Programming


Download: [PDF]

Entry Submitted: 03/18/2016
Entry Accepted: 03/18/2016
Entry Last Modified: 10/28/2016

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society