A SEQUENTIAL CONVEX PROGRAM METHOD TO DC PROGRAM WITH JOINT CHANCE CONSTRAINTS
Hits:
Indexed by:期刊论文
Journal:JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION
Included Journals:SCIE、Scopus
Volume:8
Issue:3
Page Number:733-747
ISSN No.:1547-5816
Key Words:Sequential convex approximation approach; DC programming; joint chance
constraints
Abstract:In this paper, we consider a DC (difference of convex) programming problem with joint chance constraints (JCCDCP). We propose a DC function to approximate the constrained function and a corresponding DC program (P epsilon) to approximate the JCCDCP. Under some mild assumptions, we show that the solution of Problem (PE) converges to the solution of JCCDCP when epsilon down arrow 0. A sequential convex program method is constructed to solve the Problem (P epsilon). At each iteration a convex program is solved based on the Monte Carlo method, and the generated optimal sequence is proved to converge to the stationary point of Problem (P epsilon).