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.
Author(s): J.G.Chakravorty, P.R.Ghosh
Edition: 13
Publisher: Moulik Library
Year: 2009
Language: English
City: Calcutta
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
