Projecting systems of linear inequalities with binary variables

Egon Balas

Annals of Operations Research, 2011, vol. 188, issue 1, 19-31

Abstract: We investigate methods for projecting out 0–1 variables from a system of linear inequalities. After reviewing some special cases like monotone polyhedra and the satisfiability problem, we examine why Fourier elimination cannot be applied to the general case. Finally, we give a procedure based on disjunctive programming for solving the general case. We also discuss a simpler procedure applicable only under certain conditions. Copyright Springer Science+Business Media, LLC 2011

Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-009-0623-3 (text/html)
Access to full text is restricted to subscribers.

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:annopr:v:188:y:2011:i:1:p:19-31:10.1007/s10479-009-0623-3

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-009-0623-3

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().