Chance-Constrained Two-Stage Unit Commitment under Uncertain Load and Wind Power Output Using Bilinear Benders Decomposition
arXiv:1611.08775
Abstract
In this paper, we study unit commitment (UC) problems considering the uncertainty of load and wind power generation. UC problem is formulated as a chance-constrained two-stage stochastic programming problem where the chance constraint is used to restrict the probability of load imbalance. In addition to the conventional mixed integer linear programming formulation using Big-M, we present the bilinear mixed integer formulation of chance constraint, and then derive its linear counterpart using McCormick linearization method. Then, we develop a bilinear variant of Benders decomposition method, which is an easy-to-implement algorithm, to solve the resulting large-scale linear counterpart. Our results on typical IEEE systems demonstrate that (i) the bilinear mixed integer programming formula-tion is stronger than the conventional one; (ii) the proposed Benders decomposition algorithm is generally an order of magnitude faster than using a professional solver to directly compute both linear and bilinear chance-constrained UC models.
arXiv comment10 pages, 2 figures
References in corpus (4)
- A Robust Approach to Chance Constrained Optimal Power Flow with Renewable Generation
- Distributed Stochastic Market Clearing with High-Penetration Wind Power
- A hybrid model of kernel density estimation and quantile regression for GEFCom2014 probabilistic load forecasting
- Chance Constrained Mixed Integer Program: Bilinear and Linear Formulations, and Benders Decomposition