Abstract
Classical minimax theory initiated by Von Neumann, together with duality and saddle point analysis, has played a critical role in optimization and game theory. However, minimax problems and techniques appear in a very wide area of disciplines. For example, many combinatorial optimization problems, including scheduling, location, allocation, packing, searching, and triangulation, can be represented as a minimax problem.
Nothing takes place in the world whose meaning is not that of some maximum or minimum.
L. Euler
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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Du, DZ., Pardalos, P.M., Wu, W. (2001). Minimax. In: Du, DZ., Pardalos, P.M., Wu, W. (eds) Mathematical Theory of Optimization. Nonconvex Optimization and Its Applications, vol 56. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-5795-8_11
Download citation
DOI: https://doi.org/10.1007/978-1-4757-5795-8_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5202-8
Online ISBN: 978-1-4757-5795-8
eBook Packages: Springer Book Archive