Article ID: | iaor20127257 |
Volume: | 155 |
Issue: | 2 |
Start Page Number: | 492 |
End Page Number: | 506 |
Publication Date: | Nov 2012 |
Journal: | Journal of Optimization Theory and Applications |
Authors: | Lalitha C, Chatterjee Prashanto |
Keywords: | programming: convex |
The aim of this paper is to study the stability aspects of various types of solution set of a vector optimization problem both in the given space and in its image space by perturbing the objective function and the feasible set. The Kuratowski–Painlevé set‐convergence of the sets of minimal, weak minimal and Henig proper minimal points of the perturbed problems to the corresponding minimal set of the original problem is established assuming the objective functions to be (strictly) properly quasi cone‐convex.