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.