Matrix correction of a linear programming problem with inconsistent constraints (Q1395170)

The paper is devoted to a linear programming problem with inconsistent constraints. This problem is treated as a two-criteria problem of maximizing the original linear criterion and of minimizing an admissible correction of the augmented constraint matrix. The problem is formalized as the minimization of the norm of the correcting matrix, with a lower bound on the value of the original criterion. An analysis of a sequence of auxiliary problems reduces the problem under study to the determination of eigenvalues and eigenfunctions of special matrices.