Linear programming and game theory / Dipak Chatterjee

Description:

This compact book is an excellent elucidation of the basics of optimization theory in the areas of linear programming and game theory. The theory has been developed in a systematic manner with a recapitulation of the necessary mathematical preliminaries including in good measure the elements of convexity theory. All the essential topics such as simplex algorithm, duality, revised simplex method, two-phase method and dual simplex method have been discussed lucidly. The age-old transportation and assignment problems have been treated thoroughly to manifest all the dimensions of the problems. Finally, the game theory comes with grandeur of reality of conflicts.

This user-friendly text is designed for the undergraduate students in mathematics. Besides, it will be useful to students pursuing courses in engineering, management and economics.

CHATTERJEE, DIPAK
DIPAK CHATTERJEE, Ph.D., is Director, Budge Budge Institute of Technology, Kolkata. Earlier he served as Principal, Institute of Engineering and Management, Kolkata and as Distinguished Professor and HOD, St. Xavier’s College, Kolkata. He has also been the visiting professor at many universities, engineering colleges, and management institutions.
Dr. Chatterjee has several years of experience of teaching undergraduate and postgraduate students. He has contributed a large number of research articles in different journals and also authored several textbooks.

Preface.

1. Mathematical Programming.
2. Mathematical Preliminaries.
3. Simplex Method.
4. Duality.
5. Dual Simplex Method.
6. Revised Simplex Method.
7. Integer Programming.
8. Sensitivity Analysis.
9. Transportation Problems.
10. Assignment Problems.
11. Theory of Games.

Appendix.

Bibliography.

Index.