Abstract
Primal-slack ellipsoids are described which contain all of the optimal primal feasible solutions in a standard form variant of Karmarkar's projective algorithm for linear programming (LP). Using these ellipsoids, we show how to identify optimal basic variables using few additional arithmetic operations and also simultaneously reduce the size of the LP problem during the course of the algorithm. Some preliminary computational experiments are given which compare different stopping criteria.
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.
