Necessary and Sufficient Constraint Qualification for Surrogate Duality
Access this Article
Search this Article
In mathematical programming, constraint qualifications are essential elements for duality theory. Recently, necessary and sufficient constraint qualifications for Lagrange duality results have been investigated. Also, surrogate duality enables one to replace the problem by a simpler one in which the constraint function is a scalar one. However, as far as we know, a necessary and sufficient constraint qualification for surrogate duality has not been proposed yet. In this paper, we propose necessary and sufficient constraint qualifications for surrogate duality and surrogate min-max duality, which are closely related with ones for Lagrange duality.
- Journal of Optimization Theory and Applications
Journal of Optimization Theory and Applications 152(2), 366-377, 2012-02