January 2018
Intermediate to advanced
480 pages
236h 9m
English
Most real-world linear programming problems are solved on a computer, so we concentrate here on understanding the use of linear programming and the logic on which it is based. The solution procedure in computer codes is some form of the simplex method, which is an iterative algebraic procedure for solving linear programming problems.
The graphic analysis gives insight into the logic of the simplex method, beginning with the focus on corner points. If there is any feasible solution to a problem, at least one corner point will always be the optimum, even when multiple optimal solutions are available. Thus, the simplex method ...
Read now
Unlock full access