Abstract
In this paper, we investigate set optimization problems with three types of set order relations. Various kinds of well-posedness for these problems and their relationship are concerned. Then, sufficient conditions for set optimization problems to be well-posed are established. Moreover, Kuratowski measure of noncompactness is applied to survey characterizations of well-posedness for set optimization problems. Furthermore, approximating solution maps and their stability are researched to propose the link between stability of the approximating problem and well-posedness of the set optimization problem.
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.
