Abstract
The aim of this work is to investigate optimization-related problems with the objective spaces ordered by the lexicographic cones, including parametric lexicographic equilibrium problems and optimization problems with lexicographic equilibrium constraints. We introduce concepts of Levitin–Polyak well-posedness for these problems and establish a number of sufficient conditions for such properties. The assumptions are imposed directly on the data of the problems and really verifiable. We do not need to suppose the existence (and/or convexity, compactness) of the solution set because it is proved using the mentioned assumptions on the data. Moreover, our assumptions are more relaxed than those which are usually imposed.
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.
