# An Efficient Robust Solution to the Two-Stage Stochastic Unit Commitment Problem

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

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 20 Jun 2016.

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

- [Decision-making Oriented Clustering: Application to Pricing and Power Consumption Scheduling](https://mlsanity.com/paper/2106.01021/) (2021)
- [Neural Two-Stage Stochastic Optimization for Solving Unit Commitment Problem](https://mlsanity.com/paper/2507.09503/) (2025)

## Abstract (arXiv)

This paper proposes a reformulation of the scenario-based two-stage unit commitment problem under uncertainty that allows finding unit-commitment plans that perform reasonably well both in expectation and for the worst case realization of the uncertainties. The proposed reformulation is based on partitioning the sample space of the uncertain factors by clustering the scenarios that approximate their probability distributions. It is, furthermore, very amenable to decomposition and parallelization using a column-and-constraint generation procedure.