Optimality and error bound for set optimization with application to uncertain multi-objective programming
Abstract This paper deals with optimality conditions and error bound for a set optimization problem with the set less order relation. We introduce two kinds of vectorization functions by using the classical oriented distance function, and discuss their properties with respect to the set less order relation. By virtue of the image space analysis, necessary and sufficient optimality conditions for the weak s-minimal solution are established. We propose a regular weak separation function, which is utilized to construct a gap function and an error bound for the set optimization problem. Problems of uncertain multi-objective programming, shortest path and medical image registration are examined as applications of the results established in the paper.
Abstract
This paper deals with optimality conditions and error bound for a set optimization problem with the set less order relation. We introduce two kinds of vectorization functions by using the classical oriented distance function, and discuss their properties with respect to the set less order relation. By virtue of the image space analysis, necessary and sufficient optimality conditions for the weak s-minimal solution are established. We propose a regular weak separation function, which is utilized to construct a gap function and an error bound for the set optimization problem. Problems of uncertain multi-objective programming, shortest path and medical image registration are examined as applications of the results established in the paper.
What's Your Reaction?