Abstract

In this paper, we introduce the concept of a weak $q$-distance and for this distance we derive a set-valued version of Ekeland's variational principle in the setting of uniform spaces. By using this principle, we prove the existence of solutions to a vector optimization problem with a set-valued map. Moreover, we define the $(p,\varepsilon)$-condition of Takahashi and the $(p,\varepsilon)$-condition of Hamel for a set-valued map. It is shown that these two conditions are equivalent. As an application, we discuss the relationship between an $\varepsilon$-approximate solution and a solution of a vector optimization problem with a set-valued map. Also, a well-posedness result for a vector optimization problem with a set-valued map is given.

Full Text
Paper version not known

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 call

Disclaimer: 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.