首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Convex Parametric Programming in Abstract Spaces
Abstract: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.
Keywords:Optimality  Stability  Infinite-dimensional Parametric Programming
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号