Abstract
Consider the problem of maximising a linear objective function over the polyhedron, We shall assume that℘ has a non-empty (relative) interior, and that the matrix A j has rank n thereby guaranteeing that ℘ has vertices. We describe an algorithm that generalises to the affine scaling algorithm for standard form problems, and show that, subject to a rather mild conditions, each limit point of the sequence generatsed by the algorithm is optimal, whether or not the problem is degenerate.
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.
