Mixed-Integer Linear Programming Model and Constraints Reduction Methods for Security-Constrained Unit Commitment

摘要

Security-constrained unit commitment (SCUC) is one of the most important daily tasks that must be accomplished in electric power market. To solve the SCUC problem efficiently, this paper proposes a mixed-integer linear programming (MILP) model and related constraints reduction methods. The proposed model includes both pre-and post-contingency security constraints, which are linearized by the DC power flow equation and the line outage distribution factor (LODF), respectively. The proposed constraints reduction methods reduce the security constraints of parallel branches by identifying the representative branches in each group of parallel branches, and eliminate the redundant post-contingency security constraints by analyzing the maximum possible values of post-contingency power flow. The correctness and effectiveness of the proposed model and methods are verified on 39 bus New England system and IEEE-118 test system.