Simplex Method :
When the number of variables and/or the number of constraints increases, it becomes difficult to visualize the feasible region and construct graph. In such cases an efficient competition procedure is needed to solve for the class of L.P.P’s. One such procedure is Simplex method. The Simplex method is developed by George B. Datzing in 1947. IT is an iterative and an efficient method to solve L.P.P.
The Simplex method is an algebraic procedure that starts at a feasible extreme point of simplex, normally the origin, and systematically moves from one feasible extreme point to another until an optimum extreme point is located at each iteration. The procedure tests one extreme point for optimality and if not optimum chooses another extreme point of the convex set that is formed by the constraint and non negativity conditions of the L.P.P. Since the number of extreme points of the convex set of all feasible solutions is finite, the method leads to the optimum extreme points in a finite number of steps or indicates that there exists an unbounded solution.
Latest posts by MT UVA BMS (see all)
- International Finance Important Question Bank – MT UVA BMS - May 5, 2014
- Special Studies in Finance Chapter-wise Important Sums for practice - November 25, 2013
- Operations Research Important Questions 2013 – MT UVA BMS - April 22, 2013