| Article ID: | iaor20121919 |
| Volume: | 40 |
| Issue: | 2 |
| Start Page Number: | 140 |
| End Page Number: | 143 |
| Publication Date: | Mar 2012 |
| Journal: | Operations Research Letters |
| Authors: | Fan Xiaodong, Cheng Caozong, Wang Haijun |
| Keywords: | vector optimization |
In this paper, we show that every convex semi‐infinite vector optimization (CSVO for brevity) problem can be arbitrarily approximated by stable CSVO problems, i.e., the set of all stable CSVO problems (the weak solution map is continuous or the solution map is upper semicontinuous) is dense in the set of all CSVO problems with the given topology.