Convergence for vector optimization problems with variable ordering structure.

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. [ABSTRACT FROM PUBLISHER]