# Iterative Decomposition of Joint Chance Constraints in OPF

arXiv: https://arxiv.org/abs/2010.11746 · HTML: https://mlsanity.com/paper/2010.11746/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 22 Oct 2020.

## Built on by (most cited first, 1 of 1)

- [Distributionally Robust Optimal Power Flow with Contextual Information](https://mlsanity.com/paper/2109.07896/) (2021)

## Abstract (arXiv)

In chance-constrained OPF models, joint chance constraints (JCCs) offer a stronger guarantee on security compared to single chance constraints (SCCs). Using Boole's inequality or its improved versions to decompose JCCs into SCCs is popular, yet the conservativeness introduced is still significant. In this letter, a non-parametric iterative framework is proposed to achieve the decomposition of JCCs with negligible conservativeness. An adaptive risk allocation strategy is also proposed and embedded in the framework. Results on an IEEE test case show that the conservativeness using the framework is nearly eliminated, thereby reducing the generation cost considerably.
