Abstract
The purpose of this paper is to present a new approach for solving linear programming, which has some interesting theoretical properties. In each step of the iteration, we trace a direction completely different from primal simplex method, dual simplex method, primal–dual method and interior point method. The new method is impervious to primal degeneracy and can reach a pair of exact primal and dual optimal solutions without purifying process. Numerical results are presented that support our theoretical results and confirm the viability of the approach.
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.
