Linear Optimisation, Duality: Zero-Sum Games

Wolfgang Eichhorn and Winfried Gleißner
Additional contact information
Wolfgang Eichhorn: Karlsruhe Institute of Technology (KIT)
Winfried Gleißner: University of Applied Sciences Landshut

Chapter 5 in Mathematics and Methodology for Economics, 2016, pp 177-207 from Springer

Abstract: Abstract Here we deal again with linear optimisation, but we tackle more complicated problems than in Chap. 2 For this we use the method of steepest ascent and the simplex algorithm, which allow us to solve problems in more than two or three dimensions. This is followed by the notion of duality in linear optimisation, which is useful, among others, in the theory of two-person zero-sum games. It gives us the occasion to have an insight into that theory.

Keywords: Linear Optimization Problem; Simplex Algorithm; Basic Feasible Solution; Pivot Number; Game Value (search for similar items in EconPapers)
Date: 2016
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:sptchp:978-3-319-23353-6_5

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

DOI: 10.1007/978-3-319-23353-6_5

Access Statistics for this chapter

More chapters in Springer Texts in Business and Economics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().