Convex Parametric Programming in Abstract Spaces
This article studies stability and optimality for convex parametric programming models in abstract spaces. Necessary conditions for continuity of the feasible set mapping are given in complete metric spaces. This continuity is characterized for models in which the space of decision variables is refl...
Saved in:
| Published in: | Optimization Vol. 51; no. 6; pp. 841 - 861 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Taylor & Francis Group
01.12.2002
|
| Subjects: | |
| ISSN: | 0233-1934, 1029-4945 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This article studies stability and optimality for convex parametric programming models in abstract spaces. Necessary conditions for continuity of the feasible set mapping are given in complete metric spaces. This continuity is characterized for models in which the space of decision variables is reflexive Banach space. The main result on optimality characterizes locally optimal parameters relative to stable perturbations of the parameter. The result is stated in terms of the existence of a saddle-point for a Lagrangian that uses a finite Borel measure. It does not hold for unstable perturbations even if the model is finite dimensional. The results are applicable to various formulations of control and optimal control problems. |
|---|---|
| ISSN: | 0233-1934 1029-4945 |
| DOI: | 10.1080/0233193021000015659 |