Abstract
The method of simplex Chebyshev centers is proposed. This method is identical to a special form of the dual simplex method. Analysis of the method in the initial, untransformed space leads to sufficient conditions of its applicability.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature Cited
A. Yu. Levin, “On one algorithm for minimization of convex functions,” Dokl. Akad. Nauk SSSR,160, No. 6, 1244–1247 (1965).
M. E. Primak, “On the convergence of the Chebyshev center method and the centered section method for the solution of the convex programming problem,” Dokl. Akad. Nauk SSSR,222, No. 2, 273–276 (1975).
D. B. Yudin and A. S. Nemirovskii, “Informational complexity and efficient methods of solution of convex extremal problems,” Ékonomika Mat. Metody, No. 2, 357–369 (1976).
A. S. Nemirovskii and D. B. Yudin, Complexity of Problems and Efficiency of Optimization Methods [in Russian], Nauka, Moscow (1979).
I. A. Aleksandrov, E. G. Antsiferov, and V. P. Bulatov, Centered Section Methods in Convex Programming [in Russian], Preprint No. 5, SO AN SSSR, Sib. Énerg. Inst., Irkutsk (1983).
Additional information
Translated from Kibernetika, No. 2, pp. 1–4, March–April, 1989.
Rights and permissions
About this article
Cite this article
Nenakhov, É.I., Primak, M.E. Efficiency of the dual simplex method for solving systems of linear inequalities. Cybern Syst Anal 25, 127–131 (1989). https://doi.org/10.1007/BF01070120
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01070120