Introduction to Linear Programming and the Theory of Games

by Abraham M. Glicksman

Simple exposition of linear programming and matrix games covers convex sets in the Cartesian plane and the fundamental extreme point theorem for convex polygons; the simplex method in linear programming; the fundamental duality theorem and its corollary, von Neumann's minimax theorem; more. Easily understood problems and illustrative exercises. 1963 edition.

142 pages, Paperback

First published March 22, 2001

Reviews

[Jonty White · Rating 3 out of 5]

keeps u engaged by teaching u with codeine doses