Basics in Linear and Convex Optimization

Roman A. Polyak
Additional contact information
Roman A. Polyak: School of Mathematical Sciences

Chapter Chapter 5 in Introduction to Continuous Optimization, 2021, pp 145-232 from Springer

Abstract: Abstract In the first part of this chapter we cover basic LP facts, including LP duality, special LP structure, as well as two main tools for solving LP: simplex and interior point methods (IPMs).

Date: 2021
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:spochp:978-3-030-68713-7_5

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

DOI: 10.1007/978-3-030-68713-7_5

Access Statistics for this chapter

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