The most popular non-graphical procedure for solving linear programming problems is called the simplex method. The simplex method is based on a fundamental existence theorem which states that whenever there exists one which is also basic feasible solution. Thus in the simplex method, the first step is always to obtain a basic feasible solution. This solution is then tested for optimality, i.e., it searches to see whether the value of the objective function can be improved. The generation of each successive solution requires a system of linear equations. The search continues until an optimum solution, if it exists, is determined. An important characteristic of the simplex method is that it grantees that each successive solution will be basic feasible solution and that the value of the objective function will be at least as food as the value in the previous solution.

For more help in Principles of The Simplex Method click the button below to submit your homework assignment