JAMP  Vol.7 No.1 , January 2019
Easy Simplex (AHA Simplex) Algorithm
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.
Cite this paper: Ansari, A. (2019) Easy Simplex (AHA Simplex) Algorithm. Journal of Applied Mathematics and Physics, 7, 23-30. doi: 10.4236/jamp.2019.71003.

[1]   Dantzig, G.B. (1951) Linear Programming. Applied Mathematics Series 15, National Beuro of Standards, 18-21.

[2]   Klee, V. and Minty, G.J. (1972) How Good Is the Symplex Algorithm? In: Shisha, O., Ed., Inequalities, III, Academic Press, New York, 159-175.

[3]   Khachiyan, L.G. (1979) A Polynomial Algorithm in Linear Programming. Soviet Mathematics Doklady, 20, 191-194.

[4]   Kramaker, N. (1984) A New Polynomial-Time Algorithm for Linear Programming. Combinatorica, 4, 373-395.

[5]   Cichocki, A., Unbehauen, R., Weinzierl, K. and Holzel, R. (1996) A New Neural Network for Solving Linear Programming Problems. European Journal of Operation Research, 93, 244-256.