Basic Properties of Linear Programs

David G. Luenberger and Yinyu Ye
Additional contact information
David G. Luenberger: Stanford University
Yinyu Ye: Stanford University

Chapter Chapter 2 in Linear and Nonlinear Programming, 2016, pp 11-31 from Springer

Abstract: Abstract A linear program (LP) is an optimization problem in which the objective function is linear in the unknowns and the constraints consist of linear equalities and linear inequalities. The exact form of these constraints may differ from one problem to another, but as shown below, any linear program can be transformed into the following standard form:

Keywords: Standard Form; Extreme Point; Basic Solution; Linear Programming Problem; Fundamental Theorem (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations: View citations in EconPapers (1)

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-3-319-18842-3_2

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

DOI: 10.1007/978-3-319-18842-3_2

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