An Introduction to Linear Programming and the Theory of Games

Front Cover
Courier Corporation, 2001 - Mathematics - 131 pages
0 Reviews
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.

Contents

Elementary Aspects of Linear Programming
1
Alternate Optimal Solutions
13
Convex Sets in the Cartesian Plane and
22
Convex Sets in the Cartesian Plane
29
Convex Subsets of a Line
38
The Fundamental Extreme Point Theorem
49
The Simplex Method in Linear Programming
58
The Use of Artificial Variables
70
The Condensed Simplex Tableau
74
Graphical Analysis ofmy 2 and 2 x n Matrix Games
97
Matrix Games and Linear Programming
111
References
127
Copyright

Other editions - View all

Common terms and phrases

References to this book

All Book Search results »

Bibliographic information