Abstract:
The problem of determining the minimal change in the coefficients of a consistent system of linear equations and inequalities that makes the system inconsistent is considered (the problem of determining the consistency radius of a system). If the original system is inconsistent, the inconsistency radius is defined as the solution to the problem of minimal correction of the coefficients upon which the system has a solution. For a homogeneous system of linear equations and inequalities, it is considered whether the property that a nonzero solution exists changes when correcting the parameters. A criterion for the correction magnitude is the sum of the moduli of all elements of the correction matrix. The problems of determining the consistency and inconsistency radii for systems of linear constraints written in different forms (with equality or inequality constraints and with the condition that some of the variables or all of them are nonnegative) reduce to a collection of finitely many linear programming problems.
Key words:
matrix correction, inconsistent systems of linear equations and inequalities, consistency and inconsistency radii for systems of linear equations and inequalities, improper linear programming problems.
Citation:
O. V. Murav'eva, “Determination of consistency and inconsistency radii for systems of linear equations and inequalities using the matrix l1 norm”, Zh. Vychisl. Mat. Mat. Fiz., 58:6 (2018), 873–882; Comput. Math. Math. Phys., 58:6 (2018), 840–849
\Bibitem{Mur18}
\by O.~V.~Murav'eva
\paper Determination of consistency and inconsistency radii for systems of linear equations and inequalities using the matrix $l_1$ norm
\jour Zh. Vychisl. Mat. Mat. Fiz.
\yr 2018
\vol 58
\issue 6
\pages 873--882
\mathnet{http://mi.mathnet.ru/zvmmf10700}
\crossref{https://doi.org/10.7868/S0044466918060029}
\elib{https://elibrary.ru/item.asp?id=35096872}
\transl
\jour Comput. Math. Math. Phys.
\yr 2018
\vol 58
\issue 6
\pages 840--849
\crossref{https://doi.org/10.1134/S0965542518060106}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000438129700002}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85049688525}
Linking options:
https://www.mathnet.ru/eng/zvmmf10700
https://www.mathnet.ru/eng/zvmmf/v58/i6/p873
This publication is cited in the following 5 articles:
Liu Yanwu, Tu Yan, Zhou Xiaoyang, Wang Shouyang, Zhang Zhongzhen, “The revised row pivoting method for linear programming”, Sci. Sin.-Math., 53:11 (2023), 1509
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
Ya. Liu, Ya. Tu, Zh. Zhang, “The row pivoting method for linear programming”, Omega-Int. J. Manage. Sci., 100 (2021), 102354
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