Matrix corrections minimal with respect to the Euclidean norm for linear programming problems

We consider special algebraic constructions, namely minimal matrix solutions and corrections of systems of linear algebraic equations and pairs of conjugate systems of linear algebraic equations. We build the corresponding mathematical apparatus that also lets us solve inverse linear programming problems (construct model linear programming problems with given properties), study and solve approximate and singular linear programming problems. We give statements of the theorems and numerical examples.