In this paper, we develop a method of study of Levitin–Polyak well-posedness notions for vector valued optimization problems using a class of scalar optimization problems. We first introduce a non-linear scalarization function and consider its corresponding properties. We also introduce the...

In this paper, two types of Levitin–Polyak well-posedness of vector equilibrium problems with variable domination structures are investigated. Criteria and characterizations for two types of Levitin–Polyak well-posedness of vector equilibrium problems are shown. Moreover, by virtue of a gap...

In this paper, a notion of Levitin–Polyak (LP in short) well-posedness is introduced for a vector optimization problem in terms of minimizing sequences and efficient solutions. Sufficient conditions for the LP well-posedness are studied under the assumptions of compactness of the feasible set,...

In this paper, we develop a method of study of Levitin–Polyak well-posedness notions for vector valued optimization problems using a class of scalar optimization problems. We first introduce a non-linear scalarization function and consider its corresponding properties. We also introduce the...

In this paper, two types of Levitin–Polyak well-posedness of vector equilibrium problems with variable domination structures are investigated. Criteria and characterizations for two types of Levitin–Polyak well-posedness of vector equilibrium problems are shown. Moreover, by virtue of a gap...