Disjunctive Programming and Its Relation to Integer Programming

Egon Balas

Chapter Chapter 1 in Disjunctive Programming, 2018, pp 1-16 from Springer

Abstract: Abstract Disjunctive programming is optimization over disjunctive sets. A (linear) disjunctive set is the solution set of a system of (linear) inequalities joined by the logical connectives of conjunction (∧, “and”, juxtaposition), disjunction (∨, “or”), negation (¬, “complement of”).

Keywords: Disjunctive Programming; Disjunctive Set; Feasible Integer Points; Disjunctive Cuts; Intersection Cut (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (2)

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_1

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

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

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 ().