Fast computation of global solutions to the single-period unit commitment problem

• Published in: Journal of combinatorial optimization Vol. 44; no. 3; pp. 1511 - 1536
• Main Authors: Lu, Cheng, Deng, Zhibin, Fang, Shu-Cherng, Jin, Qingwei, Xing, Wenxun
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.10.2022; Springer Nature B.V
• Subjects: Algorithms; Combinatorics; Convex and Discrete Geometry; Electricity; Global optimization; Lower bounds; Mathematical Modeling and Industrial Mathematics; Mathematics; Mathematics and Statistics; Mixed integer; Operations Research/Decision Theory; Optimization; Quadratic programming; Solvers; Theory of Computation; Unit commitment; 90C20; Mixed-integer pogramming; 90C27; Quadratic programming; Branch-and-bound algorithm; 90C11

The single-period unit commitment problem has significant applications in electricity markets. An efficient global algorithm not only provides the optimal schedule that achieves the lowest cost, but also plays an important role for deriving the market-clearing price. As of today, the problem is main...