Duality Theory

Robert J. Vanderbei
Additional contact information
Robert J. Vanderbei: Princeton University

Chapter Chapter 5 in Linear Programming, 2008, pp 55-87 from Springer

Abstract: Abstract Associated with every linear program is another called its dual. The dual of this dual linear program is the original linear program (which is then referred to as the primal linear program). Hence, linear programs come in primal/dual pairs. It turns out that every feasible solution for one of these two linear programs gives a bound on the optimal objective function value for the other. These ideas are important and form a subject called duality theory, which is the topic we shall study in this chapter.

Keywords: Dual Problem; Linear Programming Problem; Duality Theory; Simplex Method; Primal Problem (search for similar items in EconPapers)
Date: 2008
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:isochp:978-0-387-74388-2_5

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

DOI: 10.1007/978-0-387-74388-2_5

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().