Quick Simplex Algorithm for Optimal Solution to the Linear Programming Problem Alongwith Theoretical Proof of Formulae

Abstract

In this paper, a new approach is suggested while solving linear programming problems using simplex method.The method sometimes involves less iteration than in the simplex method or at the most an equal number because the method attempts to replace more than one basic variable simultaneously.