Modified Technique to Solve Degeneracy in Linear Programming Problems

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.