arXiv Analytics

Sign in

arXiv:1806.09408 [math.OC]AbstractReferencesReviewsResources

Transmission-Constrained Unit Commitment

Claudio Gambella, Jakub Marecek, Martin Mevissen, Jose Maria Fernandez Ortega, Sara Pezic Djukic, Mustafa Pezic

Published 2018-06-25Version 1

The unit commitment with transmission constraints in the alternating-current (AC) model is a challenging mixed-integer non-linear optimisation problem. We present an approach based on decomposition of a Mixed-Integer Semidefinite Programming (MISDP) problem into a mixed-integer quadratic (MIQP) master problem and a semidefinite programming (SDP) sub-problem. Between the master problem and the sub-problem, we pass novel classes of cuts. We analyse finite convergence to the optimum of the MISDP and report promising computational results on a test case from the Canary Islands, Spain.

Related articles: Most relevant | Search more
arXiv:1907.04694 [math.OC] (Published 2019-07-10)
Data-driven Network Reduction for Transmission-Constrained Unit Commitment
arXiv:2212.08178 [math.OC] (Published 2022-12-15)
Benders Decomposition for Bi-objective Linear Programs
arXiv:1905.03309 [math.OC] (Published 2019-05-08)
Distributed Dantzig-Wolfe Decomposition