Abstract
We consider special algebraic constructions, namely minimal matrix solutions and corrections of systems of linear algebraic equations and pairs of conjugate systems of linear algebraic equations. We build the corresponding mathematical apparatus that also lets us solve inverse linear programming problems (construct model linear programming problems with given properties), study and solve approximate and singular linear programming problems. We give statements of the theorems and numerical examples.
Similar content being viewed by others
References
Eremin, I.I., Mazurov, V.D., and Astaf’ev, N.N., Nesobstvennye zadachi lineinogo i vypuklogo programmirovaniya (Singular Problems of Linear and Convex Programming), Moscow: Nauka, 1983.
Tikhonov, A.N., On Approximate Systems of Linear Algebraic Equations, Zh. Vychisl. Mat. Mat. Fiz., 1980, vol. 20, no. 6, pp. 1373–1383.
Erokhin, V.I., Matrix Correction for a Dual Pair of Singular Linear Programming Problems, Zh. Vychisl. Mat. Mat. Fiz., 2007, vol. 47, no. 4, pp. 587–601.
Vatolin, A.A., Approximating Singular Linear Programming Problems with respect to the Euclidean Norm Criterion, Zh. Vychisl. Mat. Mat. Fiz., 1984, vol. 24, no. 12, pp. 1907–1908.
Gorelik, V.A. and Kondrat’eva, V.A., Parametric Programming and Singular Linear Optimization Problems, in Modeling, Decomposition, and Optimization of Complex Dynamical Processes, Moscow: Vychisl. Tsentr Ross. Akad. Nauk, 1999, pp. 57–82.
Gorelik, V.A., Matrix Correction for a Linear Programming Problem with Infeasible System of Constraints, Zh. Vychisl. Mat. Mat. Fiz., 2001, vol. 41, no. 11, pp. 1697–1705.
Erokhin, V.I., Properties of Optimal Single-Rank Correction of Coefficients in Infeasible Non-Uniform Linear Models, Diskret. Anal. Issled. Oper., 2002, Ser. 2, vol. 9, no. 1, pp. 33–60.
Gorelik, V.A., Erokhin, V.I., and Murav’eva, O.V., Some Approximation Problems for Matrices of Coefficients in Infeasible Systems of Linear Equations and Singular Linear Programming Problems, in Modelirovanie, dekompozitsiya i optimizatsiya slozhnykh dinamicheskikh protsessov (Modeling, Decomposition, and Optimization of Complex Dynamical Processes), Moscow: Vychisl. Tsentr Ross. Akad. Nauk, 2001, pp. 57–88.
Gorelik, V.A. and Ibatullin, R.R., Correction for a System of Constraints in a Linear Programming Problem under the Minimax Criterion, in Modelirovanie, dekompozitsiya i optimizatsiya slozhnykh dinamicheskikh protsessov (Modeling, Decomposition, and Optimization of Complex Dynamical Processes), Moscow: Vychisl. Tsentr Ross. Akad. Nauk, 2001, pp. 89–107.
Gorelik, V.A., Erokhin, V.I., and Pechenkin, R.V., Optimal Matrix Correction for Infeasible Systems of Linear Algebraic Equations with Block Matrices of Coefficients, Diskret. Anal. Issled. Oper., 2005, Ser. 2, vol. 12, no. 2, pp. 3–22.
Gorelik, V.A., Erokhin, V.I., and Pechenkin, R.V., Minimax Matrix Correction for Infeasible Systems of Linear Algebraic Equations with Block Matrices of Coefficients, Izv. Ross. Akad. Nauk, Teor. Sist. Upravlen., 2006, no. 5, pp. 52–62.
Gorelik, V.A., Erokhin, V.I., and Pechenkin, R.V., Chislennye metody korrektsii nesobstvennykh zadach lineinogo programmirovaniya i strukturnykh sistem uravnenii (Numerical Correction Methods for Singular Linear Programming Problems and Structural Systems of Equations), Moscow: Vychisl. Tsentr Ross. Akad. Nauk, 2006.
Vasil’ev, F.P. and Ivanitskii, A.Yu., Lineinoe programmirovanie (Linear Programming), Moscow: Faktorial, 2003.
Eremin, I.I. and Astaf’ev, N.N., Vvedenie v teoriyu lineinogo i vypuklogo programmirovaniya (Introduction to the Theory of Linear and Convex Programming), Moscow: Nauka, 1976.
Ashmanov, S.A. and Timokhov, A.V., Teoriya optimizatsii v zadachakh i uprazhneniyakh (Optimization Theory in Problems and Exercises), Moscow: Nauka, 1991.
Erokhin, V.I., Matrix Correction for Singular Linear Programming Problems with Respect to the Minimum of the Euclidean Norm with ArbitraryWeights and Fixed Elements, in Tr. XIII Baikal. mezhdunar. sh.-seminara “Metody optimizatsii i ikh prilozheniya” (Mathematical Programming: Proc. XIII Baikal Int. School-Seminar “Optimization Methods and Their Applications,”) Irkutsk: ISEM SO RAN, 2005, vol. I, pp. 105–110.
Gorelik, V.A., Zoltoeva, I.A., and Pechenkin, R.V., Correction Methods for Infeasible Linear Systems with Sparse Matrices, Diskret. Anal. Issled. Oper., 2007, Ser. 2, vol. 14, no. 2, pp. 62–75.
Zhadan, V.G. and Orlov, A.A., The Dual Newton’s Method for a Linear Semidefinite Programming Problem, in Optimizatsiya i prilozheniya (Optimization and Applications), Moscow: Vychisl. Tsentr Ross. Akad. Nauk, 2001, pp. 87–108.
Author information
Authors and Affiliations
Additional information
Original Russian Text © V.I. Erokhin, A.S. Krasnikov, M.N. Khvostov, 2012, published in Avtomatika i Telemekhanika, 2012, No. 2, pp. 11–24.
Rights and permissions
About this article
Cite this article
Erokhin, V.I., Krasnikov, A.S. & Khvostov, M.N. Matrix corrections minimal with respect to the Euclidean norm for linear programming problems. Autom Remote Control 73, 219–231 (2012). https://doi.org/10.1134/S0005117912020026
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117912020026