||A constraint qualification characterizing surrogate duality for quasiconvex programming
Suzuki, SatoshiKuroiwa, Daishi
Pacific Journal of Optimization
100 , Yokohama Publishers
In this paper, we study a constraint qualification which completely characterizes surrogate duality for quasiconvex programming. We show that the closed cone constraint qualification for surrogate duality is a necessary and sufficient constraint qualification for surrogate strong duality and surrogate min-max duality via quasiconvex programming with convex constraints. Also, we compare our constraint qualification with previous ones for Lagrange duality and surrogate duality.