On Set Containment Characterization and Constraint Qualification for Quasiconvex Programming
Access this Article
Search this Article
Dual characterizations of the containment of a convex set with qua-siconvex inequality constraints are investigated. A new Lagrange-type duality and a new closed cone constraint qualification are described, and it is shown that this constraint qualification is the weakest constraint qualification for the duality.
- Journal of Optimization Theory and Applications
Journal of Optimization Theory and Applications 149(3), 554-563, 2011-06