vix.ing · top · new · best · stats · spec

Chance constrained problems: a bilevel convex optimization perspective

2021/03/19 by Yassine Laguel, Laguel, Yassine, Jérôme Malick +3
Decision Sciences · Mathematics · #FOS: Mathematics #Fuzzy Systems and Optimization #Multi-Criteria Decision Making #Optimization and Control (math.OC) #Risk and Portfolio Optimization

paper · pdf · doi:10.48550/arxiv.2103.10832

openalex publication_date 2021/03/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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 establish an exact reformulation of chance constrained problems as a bilevel problems with convex lower-levels. We then derive a tractable penalty approach, where 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.

Citations

Related