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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
