点击次数：
论文类型：期刊论文
发表时间：2016-01-01
发表刊物：OPTIMIZATION
收录刊物：SCIE、Scopus
卷号：65
期号：12
页面范围：2171-2193
ISSN号：0233-1934
关键字：Chance constraint; joint chance constrained programs; smooth approximation; convergence analysis
摘要：This paper aims to solve the joint chance constrained programs (JCCP) by a DC (difference of two convex functions) function approach, which was established by Hong et al. [Oper. Res. 2011; 59: 617-630]. They used a DC function to approximate the chance constraint function E [1[0,8)(c(x,.))] and constructed a sequential convex approximation method to solve the approximation problem. A disadvantage of this method is perhaps that the DCfunction they used is nonsmooth. In this article, wefirst propose a class of smoothing functions to approximate the maximum function c(., z) and the indicator function 1[0,8)(.). Then, we construct the conservative smooth DC approximation function to E [1[0,8)(c(x,.))] and obtain the smooth DC approximation problems to JCCPs. We show that the solutions of a sequence of smooth approximation problems converge to some Karush-Kuhn-Tucker point of JCCPs under a certain asymptotic regime.