The principal objectives of this book are to define linear programming and its usefulness, to explain the operation and elementary theory of the simplex algorithm, to present duality theory in a simple fashion, and to give a well motivated account of matrix games.

Mathematical elegance is a constant theme in this treatment of linear programming and matrix games. Condensed tableau, minimal in size and notation, are employed for the simplex algorithm. In the context of these tableau the beautiful termination theorem of R.G. Bland is proven more simply than heretofore, and the important duality theorem becomes almost obvious. Examples and extensive discussions throughout the book provide insight into definitions, theorems, and applications. There is considerable informal discussion on how best to play matrix games. The book is designed for a one-semester...