In this paper, we first discuss the Painlevé–Kuratowski set convergence of (weak) minimal point set for a convex set, when the set and the ordering cone are both perturbed. Next, we consider a convex vector optimization problem, and take into account perturbations with respect to the feasible set, the objective function and the ordering cone. For this problem, by assuming that the data of the approximate problems converge to the data of the original problem in the sense of Painlevé–Kuratowski convergence and continuous convergence, we establish the Painlevé–Kuratowski set convergence of (weak) minimal point and (weak) efficient point sets of the approximate problems to the corresponding ones of original problem. We also compare our main theorems with existing results related to the same topic.
In this paper, the notion of the radius of robust feasibility is considered for a convex program with general convex and compact uncertainty set. An exact calculating formula for the radius of robust feasibility is given for this uncertain convex program. Moreover, we give a necessary and suficient condition for robust feasibility for uncertain convex programs to be positive. We also give some examples to illustrate our results.
In this paper, we discuss the stability of the sets of (weak) minimal points and (weak) efficient points of vector optimization problems. Assuming that the objective functions are (strictly) properly quasi convex, and the data ofthe approximate problems converges to the data of the original problems in the sense of Painlevé–Kuratowski, we establish the Painlevé–Kuratowski set convergence of the sets of (weak) minimal points and (weak) efficient points of the approximate problems to the corresponding ones of original problem. Our main results improve and extend the results of the recent papers.
20 February 2014 in Numerical Functional Analysis and Optimization
In this article, we discuss the convergence of Henig proper minimal point sets and Henig proper efficient solution sets for (strict) proper quasi-convex vector optimization problems when the data of the perturbed problems converges to the data of the original problem in the sense of Painlevé-Kuratowski. Our main results are new and different from those in the literature.