Abstract
In this paper we present a formulation of the unit commitment problem with AC power flow constraints. It is solved by a Benders’ decomposition in which the unit commitment master problem is formulated as a mixed-integer problem with linearization of the power generation constraints for improved convergence. Semidefinite programming relaxation of the rectangular AC optimal power flow is used in the subproblem, providing somewhat conservative cuts. Numerical case studies, including a 6-bus and the IEEE 118-bus network, are provided to test the effectiveness of our proposal. We show in our numerical experiments that the use of such strategy improves the quality of feasibility and optimality cuts generated by the solution of the convex relaxation of the subproblem, therefore reducing the number of iterations required for algorithm convergence.
| Original language | English |
|---|---|
| Article number | 106965 |
| Journal | Electric Power Systems Research |
| Volume | 192 |
| DOIs | |
| State | Published - Mar 2021 |
| Externally published | Yes |
Keywords
- Power flow
- Power generation dispatch
- Quadratic programming
- Relaxation methods
- Thermoelectric power generation
- Unit commitment
Fingerprint
Dive into the research topics of 'Benders’ decomposition of the unit commitment problem with semidefinite relaxation of AC power flow constraints'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver