| Article ID: | iaor20116953 |
| Volume: | 150 |
| Issue: | 2 |
| Start Page Number: | 327 |
| End Page Number: | 340 |
| Publication Date: | Aug 2011 |
| Journal: | Journal of Optimization Theory and Applications |
| Authors: | Zhou A, Yang M |
| Keywords: | programming: convex |
In this paper, firstly, a new generalized subconvexlike set‐valued map based on the quasi‐relative interior is introduced. Secondly, by a separation theorem involving the quasi‐relative interior, some separation properties are obtained. Finally, some optimality conditions are established. Our results improve some results in the literature.