When there are more than two decision variables in a LP problem, the method of solving linear programming problem by graphic method is not suitable. A procedure known as simplex method can be used to find the optimal solution. The simplex method is an efficient iterative method and is widely used in solving linear programming problems containing several variables and constraints. This method helps in examining the corner points of the feasible solution space in a systematic manner in the search of an optimal solution space in a systematic manner in the search of an optimal solution of an LP problem ensuring highest profit or the lowest cost under given constraints is obtained. The simplex method begins with zero solution and at each step of the iteration, the value of the objective function is increased until no further improvement is possible.
No comments:
Post a Comment