Abstract
For a vector optimization problem that depends on a parameter vector, the sensitivity analysis of perturbation, proper perturbation, and weak perturbation maps is dealth with. Each of the perturbation maps is defined as a set-valued map which associates to each parameter value the set of all minimal, properly minimal, and weakly minimal points of the perturbed feasible set in the objective space with respect to a fixed ordering cone. Using contingent cones in a finite-dimensional Euclidean space, we investigate the relationship between the contingent derivatives of the three types of perturbation maps and three types of minimal point sets for the contingent derivative of the feasible-set map in the objective space. These results provide quantitative informations on the behavior of the perturbation maps.
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.
