2021/09/17 by Joshua Comden, Comden, Joshua, Ahmed S. Zamzam +3
Decision Sciences · Engineering · Mathematics · #FOS: Mathematics #Fuzzy Systems and Optimization #Optimization and Control (math.OC) #Optimization and Mathematical Programming #Risk and Portfolio Optimization
paper · pdf · doi:10.48550/arxiv.2109.08742
openalex publication_date 2021/09/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Many stochastic optimization problems include chance constraints that enforce constraint satisfaction with a specific probability; however, solving an optimization problem with chance constraints assumes that the solver has access to the exact underlying probability distribution, which is often unreasonable. In data-driven applications, it is common instead to use historical data samples as a surrogate to the distribution; however, this comes at a significant computational cost from the added time spent either processing the data or, worse, adding additional variables and constraints to the optimization problem. On the other hand, the sample mean and covariance matrix are lightweight to calculate, and it is possible to reframe the chance constraint as a distributionally robust chance constraint. The challenge here is that the sample mean and covariance matrix themselves are random variables, so their uncertainty should be factored into the chance constraint. This work bridges this gap by modifying the standard method of distributionally robust chance constraints to guarantee its satisfaction. The proposed data-driven method is tested on a particularly problematic example. The results show that the computationally fast proposed method is not significantly more conservative than other methods.