Introduction to the Simplex Method
FSimplex Method .- An algebraic, iterative method to solve linear programming problems.
FThe simplex method identifies an initial basic solution (Corner point) and then systematically moves to an adjacent basic solution, which improves the value of the objective function. Eventually, this new basic solution will be the optimal solution.
FThe simplex method requires that the problem is expressed as a standard LP problem (see module on Standard Form). This implies that all the constraints are expressed as equations by adding slack or surplus variables.
FThe method uses Gaussian elimination (sweep out method) to solve the linear simultaneous equations generated in the process.