The Simplex Method
Published • Jan 1, 1967
Authors:
K. B. Haley
Abstract
The most general technique of linear programming is called the Simplex method. This method can be applied to all linear programming problems but it is not used if a simpler method is available. The transportation technique described in Chapter 3 is an example of a simpler method. The general problem...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!