Mathematical introduction to linear programming and game theory
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…
Not available to read online
This scan is restricted to patrons with print disabilities and can't be borrowed with a regular free account — signing up won't unlock it. Try Toronto Public Library, Libby, or Amazon above instead.
