Pure Cutting‐Plane Algorithms and their Convergence

Dinakar Gade, Simge Kucukyavuz

Research output: Chapter in Book/Report/Conference proceedingEntry for encyclopedia/dictionary

Abstract

Cutting‐plane methods solve a mixed‐integer program (MIP) by iteratively adding a valid linear inequality that violates a fractional solution of a linear relaxation of the problem. This article surveys cutting‐plane algorithms for different subclasses of MIPs and addresses whether these algorithms converge to an optimal solution of MIP in finitely many steps.
Original languageEnglish (US)
Title of host publicationWiley Encyclopedia of Operations Research and Management Science
Editors James J Cochran, Louis A Cox Jr, Pinar Keskinocak, Jeffrey P Kharoufeh, J Cole Smith
PublisherJohn Wiley & Sons, Inc.
ISBN (Print)978-0470400630
StatePublished - 2013

Fingerprint Dive into the research topics of 'Pure Cutting‐Plane Algorithms and their Convergence'. Together they form a unique fingerprint.

  • Cite this

    Gade, D., & Kucukyavuz, S. (2013). Pure Cutting‐Plane Algorithms and their Convergence. In J. J. Cochran, L. A. Cox Jr, P. Keskinocak, J. P. Kharoufeh, & J. C. Smith (Eds.), Wiley Encyclopedia of Operations Research and Management Science John Wiley & Sons, Inc..