Mathematical elegance is a constant theme in this treatment of linear programming and matrix games. Condensed tableaus, minimal in size and notation, are employed for the simplex algorithm. In the context of these tableaus the beautiful termination theorem of RG Bland is proven more simply than here
Mathematical introduction to linear programming and game theory
β Scribed by Louis Brickman
- Publisher
- Springer-Verlag
- Year
- 1989
- Tongue
- English
- Leaves
- 138
- Series
- Undergraduate texts in mathematics
- Edition
- Corrected
- Category
- Library
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
<p>Mathematical elegance is a constant theme in this treatment of linear programming and matrix games. Condensed tableau, minimal in size and notation, are employed for the simplex algorithm. In the context of these tableau the beautiful termination theorem of R.G. Bland is proven more simply than h
Praise for the Second Edition:"This is quite a well-done book: very tightly organized, better-than-average exposition, and numerous examples, illustrations, and applications."βMathematical Reviews of the American Mathematical SocietyAn Introduction to Linear Programming and Game Theory, Third Editio
<b>Praise for the Second Edition:</b><p> "This is quite a well-done book: very tightly organized, better-than-average exposition, and numerous examples, illustrations, and applications."<br><i>βMathematical Reviews of the American Mathematical Society</i><p><i>An Introduction to Linear Programming a
Written in a conversational tone, this classroom-tested text introduces the fundamentals of linear programming and game theory, showing readers how to apply serious mathematics to practical real-life questions by modelling linear optimization problems and strategic games. The treatment of linear pro