Abstract
In this paper, we propose a new interior point algorithm for linear programming by combining the affine scaling algorithm and the primal path-following algorithm. We define a series of subproblems whose feasible region contracts toward the set of optimal solutions. In each iteration, we take a step in the steepest descent direction in a transformed space to reduce the objective value. Our preliminary computational results are very favorable.
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.
