The Correspondence Between Lift-and-Project Cuts and Simple Disjunctive Cuts

Egon Balas

Chapter Chapter 8 in Disjunctive Programming, 2018, pp 97-105 from Springer

Abstract: Abstract From the fact that the constraint set (6.3) of (CGLP)j defines the convex hull of P ∩{x : x j ∈{0, 1}}, and that convP I, the integer hull, can be derived by imposing the disjunctions x j ≤ 0 ∨ x j ≥ 1 sequentially, it follows that any valid cut for a mixed 0-1 program can be represented as a lift-and-project cut.

Keywords: Simple Disjunctive Cuts; Integer Hull; Gomory Mixed Integer Cuts; Essential Cuts; Simplex Tableau (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-00148-3_8

Ordering information: This item can be ordered from
http://www.springer.com/9783030001483

DOI: 10.1007/978-3-030-00148-3_8

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().