Abstract
In this pedagogical note we present an improved method to solve and analyze linear programming (LP) problems. The method depends on solving a system of equations and is free of any slack, surplus or artificial variables. The proposed method eliminates the need to manipulate linear inequalities to introduce additional variables and works only within the original decision variables space. We present applications of the method to handle linear optimization with varying objective function. The proposed method is easy to implement and enhances understanding of the simplex method and LP solvers transparent. We believe it is a useful alternative approach to present LP in the class room during the first few hours of introducing the subject.
Sign-in/Register to access full text options 
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.
