Comparison between revised simplex and usual simplex methods for solving linear programming problems

Authors

  • Nejmaddin A. Sulaiman Department of Mathematics, College of Education, Salahaddin University – Erbil, Kurdistan Region,Iraq
  • Shaida O. Muhammed Department of Mathematics, Faculty of Science ,SulaimaniUniversity – Sulaimani, Kurdistan Region,Iraq

Keywords:

Simplex method, Revised simplex method (RSM), linear programming problem.

Abstract

In this paper, we defined revised simplex method (RSM) and usual simplex method(USM) to solve linear programming problems and suggested their algorithms. The numerical problems were solved by both mention methods , then results are compared. This study confirm that our techniques are valid and can be generalty applied to solve linear programming problems.

Downloads

Published

2024-05-28

How to Cite

Nejmaddin A. Sulaiman, & Shaida O. Muhammed. (2024). Comparison between revised simplex and usual simplex methods for solving linear programming problems. Journal of Computational Analysis and Applications (JoCAAA), 33(06), 899–905. Retrieved from http://eudoxuspress.com/index.php/pub/article/view/954

Issue

Vol. 33 No. 06 (2024): JOCAAA

Section

Articles

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Similar Articles

<< < 17 18 19 20 21 22 23 > >> 

You may also start an advanced similarity search for this article.