Stability and sensitivity analysis in multiobjective nonlinear programming (Q2640449)

The paper surveys several results on stability and sensitivity analysis in multiobjective nonlinear programming contained in earlier papers of the author [J. Optimization Theory Appl. 56, 479-499 (1988; Zbl 0619.90073); and SIAM J. Control Optimization 26, 521-536 (1988; Zbl 0654.49011)] and the author and \textit{Y. Sawaragi} [J. Optimization Theory Appl. 30, 229-253 (1980; Zbl 0414.90085)]. First, a family of parametrized multiobjective programming problems is considered and 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. Sufficient conditions for the continuity of the perturbation map are investigated and the quantitative behavior of the perturbation map is analyzed by using the concept of contingent derivatives for set-valued maps. Finally it is shown that more refined results can be obtained for multiobjective convex programming.