| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143047 | Operations Research Letters | 2012 | 4 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Xiaodong Fan, Caozong Cheng, Haijun Wang,