Answers are grounded in this paper and cite their sources.
Considering the economics and securities for the operation of a power system, a semi-definite programming (SDP) model for the security-constrained unit commitment (SCUC) problem is described here, which is directly solved by the interior-point method for SDP within the polynomial times. The proposed method is promising for the SCUC problems because of its excellent convergence and the ability of handling the non-covex integer variables. No model decomposition and initial relaxation are needed when applying the SDP-based method. When the solution contains minor mismatches in the integer variables, a simple rounding strategy is used to correct the non-integer into integer efficiently. Different test cases from 6 to 118 buses over a 24 h horizon are presented. Extensive numerical simulations have shown that the proposed method is capable of obtaining the optimal UC schedules without any network and bus voltage violations, and minimising the operation cost as well.
No takes yet. Share an insight, caveat, or question.
Bai et al. (2009) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: