Benders' decomposition of the unit commitment problem with semidefinite relaxation of AC power flow constraints

Author(s)

Paredes, M. ^[1] ; Martins, L. S. A. ^[1] ; Soares, S. ^[2] ; Ye, Hongxing ^[3]

Affiliation

^[1] IBM Res, Sao Paulo - Brazil

^[2] Univ Estadual Campinas, Campinas - Brazil

^[3] Cleveland State Univ, Cleveland, OH 44115 - USA

• Document type: Journal article
• Source: Electric Power Systems Research; v. 192, MAR 2021.
• Web of Science Citations: 0

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. Semi-definite 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. (AU)

• FAPESP's process: 13/07570-7 - Model of Hydrothermal Unit Commitment Using Semidefinite Programming
• Grantee: Miguel Paredes Quinones
• Support Opportunities: Scholarships in Brazil - Doctorate
• FAPESP's process: 14/08972-4 - A semidefinite programming model for the hydro-thermal unit commitment problem
• Grantee: Miguel Paredes Quinones
• Support Opportunities: Scholarships abroad - Research Internship - Doctorate