An Introduction to Linear Programming and the Theory of Games
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.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Elementary Aspects of Linear Programming
Alternate Optimal Solutions
Convex Sets in the Cartesian Plane and
Convex Sets in the Cartesian Plane
Convex Subsets of a Line
The Fundamental Extreme Point Theorem
The Simplex Method in Linear Programming
Other editions - View all
A's optimal strategy algebraic analysis artificial variables basic feasible solution basic variables basis Bibliography boundary point Bulkswagons called cartesian plane choose Classic closed half plane closed segment codeine Condensed Tableau constraints convex polygon corresponding defined DEFINITION Determine DIFFERENTIAL EQUATIONS dual edge elementary endpoint example Exercises expected payoff extreme point Figure finite number function Game Theory geometry grains of aspirin half line inequalities interior point INTRODUCTION iteration last row linear form linear programming linear programming problems matching pennies mathematical matrix game Minimax Theorem minimum value minutes mixed strategy nonbasic obtain optimal solution optimal tableau ordered pairs parameter value parametric representation payoff matrix plays HEADS plays TAILS points of JT polygonal convex region polygonal convex set Pontillacs proof Prove pure strategy real numbers saddle point set of points Simplex Method slack variables solution set solve strategy point Theory of Games topology upper bound values assumed vertices x 8K yields zero