Abstract
In this paper, we introduce the concepts for approximately minimal, approximately nondominated solutions, and approximate minimizers of vector optimization problems with respect to variable order structures. In order to describe solution concepts, we use a set-valued map and this map is not necessarily a (pointed, convex) cone-valued map. We illustrate the different concepts for approximate solutions by several examples. Important properties of these three different kinds of approximate solutions of vector optimization problems with respect to variable order structures are discussed. Finally, we give some necessary conditions for approximate solutions of vector optimization problems with variable order structures using a vector-valued variant of Ekeland’s variational principle.
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.
