Linear programming and game theory/ J.G. Chakravorty and P.R. Ghosh

Includes index

Linear programming problem -- Mathematical preliminaries -- Characteristics of an optimal solution -- Simplex method -- Simplex algorithm -- Degeneracy -- Duality -- Transportation problems -- Assignment problems -- Dual simplex method -- Revised simplex method -- Sensitivity analysis -- Integer linear programming -- Geometrical aspects of optimal solution -- Game theory

The objective of this book is o 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 understanding. In almost all instances, each new method has been immediately illustrated with numerical examples. Simplex method and its algorithm have been explained in details to suit the requirements of the students preparing for degree examination and for professional courses. Transportation and assignment problems and their solution methods have been amply illustrated. Primal-dual methods are rather specialized, but of great importance to any one working intensively in the field who needs the most efficient solution methods. Short accounts of revised simplex method and sensitivity analysis have been added to the text for the advanced readers.