Partial sample average approximation method for chance constrained problems
Résumé
In this paper, we present a new scheme of a sampling-based method to solve chance constrained programs. The main advantage of our approach is that the approximation problem contains only continuous variables whilst the standard sample average approximation (SAA) formulation contains binary variables. Although our approach generates new chance constraints, we show that such constraints are tractable under certain conditions. Moreover, we prove that the proposed approach has the same convergence properties as the SAA approach. Finally, numerical experiments show that the proposed approach outperforms the SAA approach on a set of tested instances.