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.