Linear Programming

Jean-Pierre Corriou
Additional contact information
Jean-Pierre Corriou: University of Lorraine

Chapter Chapter 10 in Numerical Methods and Optimization, 2021, pp 575-622 from Springer

Abstract: Abstract Linear programming deals with the optimization of systems of linear equations subject to linear constraints. The problem is first exposed with the introduction of slack and artificial variables. The solution is treated by means of the simplex tableau in different cases. The theoretical solution is demonstrated as well as numerical examples. The duality is discussed mathematically and also explained by examples. Interior point methods are first introduced with Karmarkar’s projection method and algorithm, followed by the affine transformation. All algorithms are accompanied by numerical examples.

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-89366-8_10

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

DOI: 10.1007/978-3-030-89366-8_10

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