Summary
Khachian's algorithm for solving a system of linear inequalities is accelerated by choosing smaller ellipsoids than in the original version. Furthermore, certain inequalities can be successively eliminated, from the constraints, yielding a different stopping rule.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Gacs, P., Lovász, L.: Khachian's algorithm for linear programming. Technical Report, Stanford University (1979)
Goldfarb, D., Todd, M.J.: Modifications and implementation of the Shor-Khachian algorithm for linear programming. Technical Report, Cornell University, Ithaca (1980)
John, F.: Fxtremum problems with inequalities as subsidiary conditions. Courant Anniv. Vol., New York: Interscience, pp. 187–204, 1948
Khachian, L.G.: A polynomial algorithm in linear programming. Soviet Math. Dokl.20, 191–194 (1979)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
König, H., Pallaschke, D. On Khachian's algorithm and minimal ellipsoids. Numer. Math. 36, 211–223 (1980). https://doi.org/10.1007/BF01396759
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01396759