Abstract
An algorithm of Khachian type for deciding the consistency of m ≥ 2 linear equalities with integer coefficients is described. New iteration formulas for updating the center and the matrix that define each localizing ellipsoid are given. A much sharper bound than that in [1] and [2] for the radius of the initial sphere is given. The new bound depends on the dimension of the solution space, but does <u>not</u> depend explicitly on m. The algorithm is much faster than Khachian's original algorithm. The volume reduction factor in the new algorithm is, in a sense, optimal. Results of computer experiments on the symbolic mathematical system MACSYMA are included.
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.
