DescriptionSimple 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.Author: GlicksmanVAT: NoMinimum Order Quantity: 0
Delivery: Usually ships in 28 days. Import title. All UK orders are POST FREE!All prices shown include applicable taxes.
Website development by NetActiv8.