Abstract:
A novel dual approach to the problem of optimal correction of first-kind improper linear programming problems with respect to their right-hand sides is proposed. It is based on the extension of the traditional Lagrangian by introducing additional regularization and barrier components. Convergence theorems are given for methods based on the augmented Lagrangian, an informal interpretation of the obtained generalized solution is suggested, and results of numerical experiments are presented.
Keywords:linear programming, improper problems, generalized solutions, barrier function method.