A Review on a Simplified Alternative Algorithm to the Simplex Method for Solving Linear Programming Problems

Subscribe to access this work and thousands more

ABSTRACT

This paper discusses the review of a new solution algorithms and a comparative analysis of standard Simplex Method and the Push and Pull algorithms in solving Linear Programming problems. Linear Programming is a branch of Operation Research in the field of mathematics. As a result of the complicated nature of solving and determining accurate results from linear programming problems, various methods and algorithms have been developed to reduce the complications and increase efficiency of solving linear programming problem. This paper reviews a newer solution algorithm known as the Push and Pull algorithm, to serve as a preferable alternative algorithm to earlier algorithms such as the standard Simplex method in solving linear programming problems. The standard Simplex algorithm requires artificial variables for solving linear programs, which lack primal feasibility at the origin point and makes use of extraneous artificial variable, this poses as an advantage for the Push-and-Pull, which obviates the use of artificial variables. This paper also presents a manual and computerized (using a software designed with Visual Basic) computational steps in solving various Linear Programming Problems with the Push and Pull algorithm and the simplex method.

Subscribe to access this work and thousands more