Parallel Randomized Algorithm for Chance Constrained Program release_fdwltuhlgzemdjwfz7avwsdlwa

by Xun Shen, Jiancang Zhuang, Xingguo Zhang

Released as a article .

2019  

Abstract

Chance constrained program is computationally intractable due to the existence of chance constraints, which are randomly disturbed and should be satisfied with a probability. This paper proposes a two-layer randomized algorithm to address chance constrained program. Randomized optimization is applied to search the optimizer which satisfies chance constraints in a framework of parallel algorithm. Firstly, multiple decision samples are extracted uniformly in the decision domain without considering the chance constraints. Then, in the second sampling layer, violation probabilities of all the extracted decision samples are checked by extracting the disturbance samples and calculating the corresponding violation probabilities. The decision samples with violation probabilities higher than the required level are discarded. The minimizer of the cost function among the remained feasible decision samples are used to update optimizer iteratively. Numerical simulations are implemented to validate the proposed method for non-convex problems comparing with scenario approach. The proposed method exhibits better robustness in finding probabilistic feasible optimizer.
In text/plain format

Archived Files and Locations

application/pdf  630.4 kB
file_akscejkdzjhb7hadrpexzb36ze
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2019-11-07
Version   v3
Language   en ?
arXiv  1911.00192v3
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 502d588d-1d0e-4797-a6dc-e8da4a234c9b
API URL: JSON