Abstract
In this paper, Levitin-Polyak well-posedness for set-valued optimization problems with constraints is introduced. Some sufficient and necessary conditions for the Levitin-Polyak well-posedness of these problems are established under some suitable conditions. The equivalence between the wellposedness of optimization problems with constraints and the existence and uniqueness of their solutions are proved. Finally, we give some examples to illustrate the presented results.
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.
