Abstract
We present an extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex. It is shown that in at most O(nL) steps, the algorithm produces a feasible point or proves that the problem has no solution. The complexity is O(n 2 m 2 L) arithmetic operations. The algorithm is endowed with two new powerful 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.
