Duality and correction of inconsistent constraints for improper linear programming problems

We continue the study of approximation properties of alternative duality schemes for improper problems of linear programming. The schemes are based on the use of the classical Lagrange function regularized simultaneously in direct and dual variables. The results on the connection of its saddle points with the lexicographic correction of the right-hand sides of constraints in improper problems of the first and second kind are transferred to a more general type of improperness. Convergence theorems are presented and an informal interpretation is given for the obtained generalized solution.