Graphical View of Quick Simplex Method to Solve Linear Programming Problem

  • Nalini V. Vaidya, Smita R Pidurkar, Manoj Shanti, Satyajit S Uparkar

Abstract

In this paper, our purpose is to present the principles of quick simplex method and the techniques graphically. We have compared conventional simplex method and quick simplex method.  Beginning with the graphical method which provide a great deal of insight into the basic concepts, the quick simplex method of solving linear programming problems is developed. Quick simplex method  assume that the initial simplex table does not give optimal solution. A new method has been developed to replace more than one basic variables simultaneously whenever possible and obtaining simplex table after such replacement.[6]. It is shown that by graphically how the quick simplex method is powerful  than the conventional simplex method using some examples. Also we used second criteria of selecting pivotal elements in quick simplex method to  solve the problem.[8] The application under this research work is based on quick simplex method. We have applied quick simplex method in Dual simplex [11], Two phase simplex [10],Game theory model. [5,7].Quick simplex method is suggested while solving two phase simplex method, which can be apply in phase I and phase II which results less iterations than in simplex method or at the most an equal number. Effect of this method on the reduction of iteration was observed.

Published
2020-05-20
How to Cite
Nalini V. Vaidya, Smita R Pidurkar, Manoj Shanti, Satyajit S Uparkar. (2020). Graphical View of Quick Simplex Method to Solve Linear Programming Problem. International Journal of Advanced Science and Technology, 29(06), 5694 - 5710. Retrieved from https://sersc.org/journals/index.php/IJAST/article/view/19843