|
This article is cited in 10 scientific papers (total in 10 papers)
Minimum-Euclidean-norm matrix correction for a pair of dual linear programming problems
V. V. Volkova, V. I. Erokhinb, A. S. Krasnikovc, A. V. Razumovb, M. N. Khvostova a Borisoglebsk Branch, Voronezh State University, Borisoglebsk, Voronezh oblast, Russia
b Mozhaisky Military Space Academy, St. Petersburg, Russia
c Russia State Social University, Moscow, Russia
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.
Received: 24.10.2016
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
Linking options:
https://www.mathnet.ru/eng/zvmmf10635 https://www.mathnet.ru/eng/zvmmf/v57/i11/p1788
|
|