Abstract
In this paper some results on stability and sensitivity analysis in multiobjective nonlinear programming are surveyed. Given a family of parametrized multiobjective programming problems, the perturbation map is defined as the set-valued map which associates to each parameter value the set of minimal points of the perturbed feasible set with respect to an ordering convex cone. The behavior of the perturbation map is analyzed both qualitatively and quantitatively. First, some sufficient conditions which guarantee the upper and lower semicontinuity of the perturbation map are provided. The contingent derivatives of the perturbation map are also studied. Moreover, it is shown that the results can be refined in the convex case.
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.
