Abstract
An algorithm is designed for numerically solving large-dimensional mathematical programming problems, in which only the variables in linear constraints play a dominant role.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Polyak, B.T., Vvedenie v optimizatsiyu (Introduction to Optimization), Moscow: Nauka, 1983.
Vasil'ev, F.P., Chislennye metody teorii ekstremal'nykh zadach (Numerical Methods of the Theory of Extremal Problems), Moscow: Nauka, 1980.
Dem'yanov, V.F. and Rubinov, A.M., Priblizhennye metody resheniya ekstremal'nykh zadach (Approximate Methods of Solving Extremal Problems), Leningrad: Leningrad. Gos. Univ., 1968.
Arrow, K.J., Hurwicz, L., and Uzawa, H., Studies in Linear and Non-linear Programming, Stanford: Stanford Univ. Press, 1958. Translated under the title Issledovanie po lineinomu i nelineinomu programmirovaniyu, Moscow: Inostrannaya Literatura, 1962.
Zoutendijk, G., Methods of Feasible Directions: A Study in Linear and Nonlinear Programming, New York: Elsevier, 1960. Translated under the title Metody vozmozhnykh napravlenii, Moscow: Inostrannaya Literatura, 1963.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bobylev, N.A., Zalozhnev, A.Y. & Klykov, A.Y. Large-Dimensional Mathematical Programming Problems: A Solution Approach. Automation and Remote Control 63, 330–334 (2002). https://doi.org/10.1023/A:1014264028463
Issue Date:
DOI: https://doi.org/10.1023/A:1014264028463