Linear Programming And Game Theory is a comprehensive guide for students studying linear programming.
Linear Programming and Game Theory
β Scribed by J.G.Chakravorty, P.R.Ghosh
- Publisher
- Moulik Library
- Year
- 2009
- Tongue
- English
- Leaves
- 596
- Edition
- 13
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
The objective of this book is to present a reasonably complete account of linear programming. The mathematical development is based on the theory of linear simultaneous equations, without the usual notions from the mathematics of vector spaces. The mathematical development has been carried out in such a manner that only one year of college level mathematics will be enough for its understanding. In almost all instances, each new method has been immediately illustrated with numerical examples. To maintain the standard of the book, we have set problems from different Indian university examinations.
β¦ Table of Contents
I. Linear Programming
1. Linear Programming Problem
2. Mathematical Preliminaries
3. Characteristics of an optimal solution
4. Simplex Method
5. Simplex Algorithm
6. Degeneracy
7. Duality
8. Transportation Problem
9. Assignment Problem
10. Dual Simplex Method
11. Revised Simplex Method
12. Sensitivity Analysis
13. Integer Linear Programming
14. Geometrical aspects of optimal solution
II. Game Theory
π SIMILAR VOLUMES
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
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
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
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