概率约束规划逼近问题最优解集的下半收敛性  

The Lower Semiconvergence of Optimal Solution Sets of Approximation Problems for Probabilistic Constraints Programming

作　　者：霍永亮[1] 

机构地区：[1]重庆文理学院数学与统计学院,重庆永川402160

出　　处：《西南师范大学学报（自然科学版）》2010年第6期16-19,共4页Journal of Southwest China Normal University(Natural Science Edition)

基　　金：重庆市教委科学技术研究基金资助项目(KJ091211);重庆文理学院引进人才专项资助项目

摘　　要：在初始概率约束规划问题水平集正则的条件下,利用最优解集的结构特征给出了概率约束规划逼近问题最优解集下半收敛的一个充分条件,并由此结果给出了概率约束规划逼近问题最优解集Hausdorff收敛的一个充分条件.Under regularity condition of level set for original probabilistic constraints programming,a sufficient condition of the lower semiconvergence of approximate optimal solution sets for probabilistic constraints programming is studied by using structure characteristic of optimal solution sets,and making use of this result gives out a sufficient condition for Hausdorff convergence of approximate optimal solution sets for probabilistic constraints programming.

关 键 词：概率约束规划 逼近最优解集 下半收敛性 Hausdorff收敛 

分 类 号：O221.5[理学—运筹学与控制论]