Mathematical introduction to linear programming and game theory

by Louis Brickman

1989 130 pages eng

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 here…