Hostname: page-component-7479d7b7d-8zxtt Total loading time: 0 Render date: 2024-07-13T22:34:13.534Z Has data issue: false hasContentIssue false
  • English
  • Français

A direct ellipsoid method for linear programming

Published online by Cambridge University Press:  17 April 2009

Shiquan Wu  and
Fang Wu
Shiquan Wu
Affiliation:
Institute of Applied Mathematics, Academia Sinica Beijing 100080, China
Fang Wu
Affiliation:
Institute of Applied Mathematics, Academia Sinica Beijing 100080, China
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

This paper indicates how to apply the ellipsoid method directly to Linear Programming problems and proves that this kind of version of the ellipsoid method is almost as good as Karmarkar's type method in the theoretical sense.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 47 , Issue 1 , February 1993 , pp. 73 - 78
Copyright
Copyright © Australian Mathematical Society 1993

References

[1]Khachiyan, L.G., ‘A polynomial algorithm for linear programming’, Dokl. Akad. Nauk USSR 244 (1979), 1093–96. Translated in Soviet Math. Dokl. 20, pp. 191–194.Google Scholar
[2]Karmarkar, N., ‘A new polynomial-time algorithm for linear programming’, Combinatorica 4 (1984), 373–375.CrossRefGoogle Scholar
[3]Grötschel, M., Lovász, L. and Schrijver, A., Geometric algorithms and combinatorial optimization (Springer-Verlag, Berlin, Heidelberg, New York, 1988).CrossRefGoogle Scholar
[4]Eggleston, H.G., Convexity (Cambridge University Press, Cambridge, 1958).CrossRefGoogle Scholar
[5]Goffin, J.L., ‘Convergence rates of the ellipsoid method on general convex functions’, Math. Oper. Res. 8 (1983), 135–150.CrossRefGoogle Scholar
[6]Todd, M.J., Improved bounds and containing ellipsoids in Karmarkar's linear programming algorithm, Technical report 721 (Cornell University, 1986).Google Scholar
[7]Ye, Y., ‘Karmarkar's algorithm and the ellipsoid method’, Oper. Res. Lett. 4 (1987), 177–182.CrossRefGoogle Scholar
[8]Lüthi, H.J., ‘On the solution of variational inequalities by the ellipsoid method’, Math. Oper. Res. 10 (1985), 515–522.CrossRefGoogle Scholar
[9]Padberg, M.W. and Rao, M.R., The Russian method for linear inequalities and linear optimization GBA Working Paper (New York University, New York, 1980).Google Scholar
[10]Padberg, M.W. and Rao, M.R., The Russian method for linear inequalities II: Approximate arithmetic, GBA Working Paper (New York University, New York, 1980).Google Scholar