Modified Technique to Solve Degeneracy in Linear Programming Problems

Sadia Qureshi; Asif Ali Shaikh; Sania Qureshi

doi:10.58496/BJM/2024/009

Authors

Sadia Qureshi Department of Basic Science and Related Studies, Mehran University of Engineering and Technology, Jamshoro, Pakistan. https://orcid.org/0000-0003-3422-198X
Asif Ali Shaikh Department of Basic Science and Related Studies, Mehran University of Engineering and Technology, Jamshoro, Pakistan. https://orcid.org/0000-0002-3084-922X
Sania Qureshi Department of Basic Science and Related Studies, Mehran University of Engineering and Technology, Jamshoro, Pakistan. https://orcid.org/0000-0002-7225-2309

DOI:

https://doi.org/10.58496/BJM/2024/009

Keywords:

Simplex method, Degeneracy, Alternative solution, Modified simplex algorithm, optimum solution

Abstract

This paper addresses degeneracy that has been analyzed in the simplex method in Linear programming (LP) issues. The newly changed technique is proposed for choosing particular pivot rows from leaving variables. This method offers greater beneficial and faster consequences in the assessment of the prevailing classical approach. The proposed set of rules is a higher preference to avoid the confusion of taking an arbitrary ratio to pick out leaving variables and for this reason, the proposed method is robust to solve degeneracy in linear programming (LP) problems.

Downloads

Download data is not yet available.

Modified Technique to Solve Degeneracy in Linear Programming Problems

Authors

DOI:

Keywords:

Abstract

Downloads

Downloads

Published

How to Cite

Issue

Section

Make a Submission

Make a Submission

Content

Current Issue

Information