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.
For when the One Great Scorer comes
To write against your name,
He marks—not that you won or lost—
But how you played the game.
GRANTLAND RICE (1880–1954)
American sports journalist and poet
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Eichhorn, W., Gleißner, W. (2016). Linear Optimisation, Duality: Zero-Sum Games. In: Mathematics and Methodology for Economics. Springer Texts in Business and Economics. Springer, Cham. https://doi.org/10.1007/978-3-319-23353-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-23353-6_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23352-9
Online ISBN: 978-3-319-23353-6
eBook Packages: Economics and FinanceEconomics and Finance (R0)