Back to Search
Start Over
Chance-constrained programs with convex underlying functions: a bilevel convex optimization perspective.
- Source :
- Computational Optimization & Applications; Jul2024, Vol. 88 Issue 3, p819-847, 29p
- Publication Year :
- 2024
-
Abstract
- Chance constraints are a valuable tool for the design of safe decisions in uncertain environments; they are used to model satisfaction of a constraint with a target probability. However, because of possible non-convexity and non-smoothness, optimizing over a chance constrained set is challenging. In this paper, we consider chance constrained programs where the objective function and the constraints are convex with respect to the decision parameter. We establish an exact reformulation of such a problem as a bilevel problem with a convex lower-level. Then we leverage this bilevel formulation to propose a tractable penalty approach, in the setting of finitely supported random variables. The penalized objective is a difference-of-convex function that we minimize with a suitable bundle algorithm. We release an easy-to-use open-source python toolbox implementing the approach, with a special emphasis on fast computational subroutines. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 09266003
- Volume :
- 88
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- Computational Optimization & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 177817564
- Full Text :
- https://doi.org/10.1007/s10589-024-00573-9