Abstract:
For a pair of dual (possibly improper) linear programming problems, a family of matrix corrections is studied that ensure the existence of given solutions to these problems. The case of correcting the coefficient matrix and three cases of correcting an augmented coefficient matrix (obtained by adding the right-hand side vector of the primal problem, the right-hand-side vector of the dual problem, or both vectors) are considered. Necessary and sufficient conditions for the existence of a solution to the indicated problems, its uniqueness is proved, and the form of matrices for the solution with a minimum Euclidean norm is presented. Numerical examples are given.
Key words:
dual pair of linear programming problems, improper linear programming problems, inverse linear programming problems, minimal matrix correction, Euclidean norm.
Citation:
V. V. Volkov, V. I. Erokhin, A. S. Krasnikov, A. V. Razumov, M. N. Khvostov, “Minimum-Euclidean-norm matrix correction for a pair of dual linear programming problems”, Zh. Vychisl. Mat. Mat. Fiz., 57:11 (2017), 1788–1803; Comput. Math. Math. Phys., 57:11 (2017), 1757–1770
This publication is cited in the following 11 articles:
Yana Beresneva, Irina Kulibaba, M. Shamtsyan, I. Kulova, “Simulation model of crop yield on individual land plot”, BIO Web Conf., 130 (2024), 01019
Igor Krasilnikov, Irina Krasnikova, E.N. Ponomareva, I.V. Tkacheva, A.R. Neidorf, “Software tools for training specialists in aquatic bioresources and aquaculture”, BIO Web Conf., 138 (2024), 04011
Irina Krasnikova, Viktoriya Grankina, E.N. Ponomareva, I.V. Tkacheva, A.R. Neidorf, “Machine vision based intelligent system for artificially reared fish condition monitoring”, BIO Web Conf., 138 (2024), 01016
Vladimir Simonov, Alex Karpov, N. Yakovenko, M. Gutalj, S. Ignateva, “Intelligent system for monitoring forest plantations condition using unmanned aerial technologies”, BIO Web Conf., 145 (2024), 04033
V. D. Skarin, “O regulyarizovannom metode barernykh funktsii v analize nesobstvennykh zadach vypuklogo programmirovaniya”, Tr. IMM UrO RAN, 30, no. 4, 2024, 234–250
V. D. Skarin, “The Method of Quasi-Solutions Based on Barrier Functions in the Analysis of Improper Convex Programs”, Proc. Steklov Inst. Math. (Suppl.), 319, suppl. 1 (2022), S242–S256
V. D. Skarin, “Metod kvazireshenii v analize zadach vypuklogo programmirovaniya s osobennostyami”, Tr. IMM UrO RAN, 27, no. 4, 2021, 125–141
V. D. Skarin, “O vybore parametrov v metode kvazireshenii dlya korrektsii nesobstvennykh zadach vypuklogo programmirovaniya”, Tr. IMM UrO RAN, 26, no. 3, 2020, 187–197
Yashen Wang, Yifeng Liu, Haiyong Xie, Lecture Notes in Computer Science, 11632, Artificial Intelligence and Security, 2019, 237
Vladimir Erokhin, Sergey Sotnikov, Andrey Kadochnikov, Alexey Vaganov, Communications in Computer and Information Science, 1090, Mathematical Optimization Theory and Operations Research, 2019, 283
F. P. Vasil'ev, M. M. Potapov, L. A. Artem'eva, “Extragradient method for correction of inconsistent linear programming problems”, Comput. Math. Math. Phys., 58:12 (2018), 1919–1925