Abstract
Possibilities are investigated of the combined use of interior and exterior penalty functions for discovering the generalized (approximate) solutions of improper problems of linear programming of the 1st kind. Diagrams of algorithms, theorems of convergence, results of numerical experiments are presented.
Similar content being viewed by others
References
Eremin, I.I., Duality for Improper Problems of Linear and Convex Programming, Dokl. Akad. Nauk SSSR, 1981, vol. 256, no. 2, pp. 272–276.
Eremin, I.I., Mazurov, Vl.D., and Astafiev, N.N., Nesobstvennye zadachi lineinogo i vypuklogo programmirovaniya (Improper Problems of Linear and Convex Programmming), Moscow: Nauka, 1983.
Eremin, I.I., Protivorechivye modeli optimal’nogo planirovaniya (Contradictory Models of Optimal Planning), Moscow: Nauka, 1988.
Morozov, V.A., On Pseudosolutions, Zh. Vychisl. Mat. Mat. Fiz., 1969, vol. 9, no. 6, pp. 1387–1391.
Kochikov, I.V., Matvienko, A.N., and Yagola, A.G., Generalized Principle of the Residual for Solution of Incompatible Equations, Zh. Vychisl. Mat. Mat. Fiz., 1984, vol. 24, no. 7, pp. 1087–1090.
Issledovaniya po nesobstvennym zadacham optimizatsii: sb. statei (Investigations on Improper Problems of Optimization: Collection of Works), Sverdlovsk: UrO Akad. Nauk SSSR, 1988.
Parametricheskaya optimizatsiya i metody approksimatsii nesobstvennykh zadach matematicheskogo programmirovaniya: sb. statei (Parametric Optimization and Methods of Approximation of the Improper Problems of Mathematical Programming: Collection of Works), Sverdlovsk: UNTs Akad. Nauk SSSR, 1985.
Neregulyarnaya dvoistvennost’ v matematicheskom programmirovanii: sb. statei (Irregular Duality in Mathematical Programming: Collextion of Works), Sverdlovsk: UrO Akad. Nauk SSSR, 1990.
Popov, L.D., Application of the Modified Method for Optimal Correction of Improper Problems of Convex Programming, Tr. Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk, 1995, vol. 3, pp. 261–266.
Popov, L.D., Symmetric Systems and Fejer Processes for Improper Problems of Linear Programming, Methods of Optimization and Their Applications: Proc. XIII Intern. Baikal. Sch. Seminar (ISEM SO Ross. Akad. Nauk), Irkutsk, 2005, vol. 1, pp. 141–146.
Skarin, V.D., On the Method of Barrier Functions and Algorithms for Correction of Improper Problems of Convex Programming, Tr. Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk, 2008, vol. 14, no. 2, pp. 115–128.
Fiacco, A.V. and McCormick, G.P, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, New York: Wiley, 1968. Translated under the title Nelineinoe programmirovanie. Metody posledovatel’noi bezuslovnoi minimizatsii, Moscow: Mir, 1972.
Roos, C., Terlaky, T., and Vial, J.-Ph., Theory and Algorithms for Linear Optimization, Chichester: Wiley, 1997.
Author information
Authors and Affiliations
Additional information
Original Russian Text © L.D. Popov, 2012, published in Avtomatika i Telemekhanika, 2012, No. 3, pp. 3–11.
Rights and permissions
About this article
Cite this article
Popov, L.D. Use of barrier functions for optimal correction of improper problems of linear programming of the 1st kind. Autom Remote Control 73, 417–424 (2012). https://doi.org/10.1134/S0005117912030010
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117912030010