Connectedness of G-proper Efficient Solution Set for Multiobjective Programming Problem

In this paper, we investigate the connectedness of G-proper efficient solution set for multiobjective programming problem. It is shown that the G-proper efficient solution set is connected if objective functions are convex. A sufficient condition for the connectedness of G-proper efficient solution set is established when objective functions are strictly quasiconvex.

On Connectedness of Efficient Solution Sets for a Star Cone-Quasiconvex Vector Optimization Problem

In this note, we prove that the efficient solution set for a vector optimization problem with a continuous, star cone-quasiconvex objective mapping is connected under the assumption that the ordering cone is a D-cone. A D-cone includes any closed convex pointed cones in a normed space which admits strictly positive continuous linear functionals.

Painlevé-Kuratowski Stability of the Solution Sets to Perturbed Vector Generalized Systems

In this paper, stability results of solution mappings to perturbed vector generalized system are studied. Firstly, without the assumption of monotonicity, the Painleve-Kuratowski convergence of global efficient solution sets of a family of perturbed problems to the corresponding global efficient solution set of the generalized system is obtained, where the perturbations are performed on both the objective function and the feasible set. Then, the density and Painleve-Kuratowski convergence results of efficient solution sets are established by using gamma convergence, which is weaker than the assumption of continuous convergence. These results extend and improve the recent ones in the literature.