February 2016
Intermediate to advanced
480 pages
219h 58m
English
Most real-world linear programming problems have more than two variables and thus are too complex for graphical solution. A procedure called the simplex method may be used to find the optimal solution to such problems. The simplex method is actually an algorithm (or a set of instructions) with which we examine corner points in a methodical fashion until we arrive at the best solution—highest profit or lowest cost. Computer programs (such as Excel OM and POM for Windows) and Excel spreadsheets are available to solve linear programming problems via the simplex method.
For details regarding the algebraic steps of the simplex algorithm, ...
Read now
Unlock full access