Abstract
This paper deals with the well-posedness of families of finite dimensional vector optimization problems ordered by components (Pareto problem). For this problem, two Hadamard well-posedness concepts are introduced. These concepts involve the existence and uniqueness of efficient/weak efficient solutions, and also the continuous behavior of these solutions with respect to perturbations of the data. The perturbations in the last property are formulated through a variational convergence notion of the objective functions and by considering approximate solutions of the perturbed problems. Necessary and sufficient conditions for the well-posedness of Pareto optimization problems are obtained in general, and also under convexity and quasiconvexity assumptions. To do this, asymptotic mathematical tools are employed. Finally, it is proved that the convex Pareto optimization problems are “essentially” well-posed in the sense of category theory.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
