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...

Full description

Saved in:
Bibliographic Details
Published in:Optimization Vol. 51; no. 6; pp. 841 - 861
Main Authors: Asgharian, M., Zlobec, S.
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!
Be the first to leave a comment!
You must be logged in first