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].
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received: January 1999 / Accepted: March 2000¶Published online December 15, 2000
Rights and permissions
About this article
Cite this article
Owen, J., Mehrotra, S. A disjunctive cutting plane procedure for general mixed-integer linear programs. Math. Program. 89, 437–448 (2001). https://doi.org/10.1007/PL00011407
Issue Date:
DOI: https://doi.org/10.1007/PL00011407