Abstract
The aim of this work is to generalize strong duality theorems for inexact linear programming and to derive duality results for inexact semi-infinite programming problems. We give a detailed proof of the general result, using the Dubovitskii–Milyutin approach. The last section contains applications to inexact problems and a few comments for further developments.
Acknowledgments
This work has been supported by CONICYT (Chile), under FONDECYT Grants 1000(7000)914 and 1020(7020)646, and FONDAP Program in Applied Mathematics. The authors also wish to thank the referees for their careful reading and constructive remarks.
Notes
E-mail: [email protected]
E-mail: [email protected]
E-mail: [email protected]