Minimum-Euclidean-norm matrix correction for a pair of dual linear programming problems

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.