Comparison between revised simplex and usual simplex methods for solving linear programming problems

Abstract

In this paper, we defined revised simplex method (RSM) and usual simplex method(USM) to solve linear programming problems and suggested their algorithms. The numerical problems were solved by both mention methods , then results are compared. This study confirm that our techniques are valid and can be generalty applied to solve linear programming problems.