Abstract
We present an algorithm, analogous to Karmarkar's algorithm, for the linear programming problem: maximize c T x subject to Ax ⩽ b, which works directly to the space of linear inequalities. The main new idea in this algorithm is the simple construction of a projective transformation of the feasible region that maps the current iterate x to the analytic center of the transformed feasible region.
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.
