Resumen de Data-driven tuning for chance constrained optimization: analysis and extensions
Ashley M. Hou, Line A. Roald
Many optimization problems involve uncertain parameters which, if not appropriately accounted for, can cause solution infeasiblity. In this work, we consider joint chance-constrained optimization problems, which require all constraints to hold with a given probability, and a two-step solution method based on iterative tuning. Previous work established an a priori feasibility guarantee for this tuning approach, which relies on an assumption that must be verified on a case-by-case basis. In this paper, we propose an empirical methodology using statistical hypothesis testing to assess the validity of this assumption, thus providing further insight into the validity of the a priori guarantee. In addition, we provide sample complexity results to assess the requisite amount of data for the tuning method. We find that for large scale optimization problems, the tuning approach may require significantly less samples than the scenario approach. We numerically assess these results via application to the optimal power flow problem as well as further assess the scalability of the method and the optimality and feasibility of solutions obtained from tuning.
