Comparing study between simplex method and Lagrange method in a linear programming problem

Abstract

This study aims to discuss a different way to solve a linear programming problems.  Two methods are discussed in this paper to determine a suitable method to solve these problems, and to determine which one is the easiest.  We used: Simplex method and Lagrange method.  Two methods were applied in general system to evaluate the result and compare between them.  After that the researchers applying the numerical example to find the degree of readers satisfaction for these methods.  The results of this study indicated that a two methods were a better, but the second method is easier than the first method.