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.The dualiy of a linear programing problem has a nice interplay in economics. ... Solution: We rewrite the problem as Maximize 2 = xt - xa#39;2 + x\ + 3*j - 3jcj + 2x4 - x\ + x\ + 0xa#39;s + 0*3 + Qx4 alt; 1 - 3*2 + 3x2aquot; + xa#39;3 + x\ + 0*4 alt; 7 + Oxj + 0xa#39;2 + xj - x\anbsp;...
|Title||:||LINEAR PROGRAMMING AND GAME THEORY|
|Publisher||:||PHI Learning Pvt. Ltd. - 2005-01-01|