Lexicographic regularization and duality for improper linear programming problems

Resumo

A new approach to the optimal lexicographic correction of improper linear programming problems is proposed. The approach is based on the multistep regularization of the classical Lagrange function with respect to primal and dual variables simultaneously. The regularized function can be used as a basis for generating new duality schemes for problems of this kind. Theorems on the convergence and numerical stability of the method are presented, and an informal interpretation of the obtained generalized solution is given.