TITLE:
Easy Simplex (AHA Simplex) Algorithm
AUTHORS:
A. H. Ansari
KEYWORDS:
Linear Programming, Simplex Algorithm, Optimal Solution, Easy Simplex Algorithm, AHA Simplex Algorithm
JOURNAL NAME:
Journal of Applied Mathematics and Physics,
Vol.7 No.1,
January
10,
2019
ABSTRACT: The purpose of this research paper
is to introduce Easy Simplex Algorithm which is developed by author. The
simplex algorithm first presented by G. B. Dantzing, is generally used for
solving a Linear programming problem (LPP). One of the important steps of the
simplex algorithm is to convert all unequal constraints into equal form by
adding slack variables then proceeds to basic solution. Our new algorithm i) solves the LPP without equalize the constraints and ii) leads to optimal solution definitely in lesser time. The goal of
suggested algorithm is to improve the simplex algorithm so that the time of
solving an LPP will be definitely lesser than the simplex algorithm. According
to this Easy Simplex (AHA Simplex) Algorithm the use of Big M method is not required.