A disjunctive cutting plane procedure for general mixed-integer linear programs

Jonathan H. Owen*, Sanjay Mehrotra

*Corresponding author for this work

Research output: Contribution to journalArticle

23 Scopus citations

Abstract

In this paper we develop a cutting plane algorithm for solving mixed-integer linear programs with general-integer variables. A novel feature of the algorithm is that it generates inequalities at all γ-optimal vertices of the LP-relaxation at each iteration. The cutting planes generated in the procedure are found by considering a natural generalization of the 0-1 disjunction used by Balas, Ceria, and Cornuéjols in the context of solving binary mixed-integer linear programs [3,4].

Original languageEnglish (US)
Pages (from-to)437-448
Number of pages12
JournalMathematical Programming, Series B
Volume89
Issue number3
DOIs
StatePublished - Jan 1 2001

Keywords

  • Mixed integer programming

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Fingerprint Dive into the research topics of 'A disjunctive cutting plane procedure for general mixed-integer linear programs'. Together they form a unique fingerprint.

Cite this