Abstract
In this paper, we study a general path-following model for linear programming. Generalized barrier functions for linear programming are defined to create an ideal interior trajectory for path-following. The key components required for a generic algorithm, including the moving directions and criterion of closeness are discussed. A generic path-following algorithm is proposed and sufficient conditions for convergence and polynomality proofs are derived.
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.
