| Article ID: | iaor20115127 |
| Volume: | 149 |
| Issue: | 3 |
| Start Page Number: | 554 |
| End Page Number: | 563 |
| Publication Date: | Jun 2011 |
| Journal: | Journal of Optimization Theory and Applications |
| Authors: | Suzuki Satoshi, Kuroiwa Daishi |
| Keywords: | programming: convex |
Dual characterizations of the containment of a convex set with quasiconvex 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.