Novel methods for Solving Economic Dispatch of Security-Constrained Unit Commitment Based on Linear Programming

2017 2nd International Seminar on Advances in Materials Science and Engineering

Guo, Sangang^1

School of Mathematics and Computer Science, Shaanxi University of Technology, Hanzhong

723000, China^1

关键词: Coefficient methods;    Lagrangian frameworks;    Linear programming problem;    Numerical testing;    Piecewise linear approximations;    Power economic dispatches;    Security constrained unit commitment;    Security constrained unit commitment problems;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/231/1/012066/pdf
DOI  :  10.1088/1757-899X/231/1/012066

来源: IOP

【 摘 要 】

There are two stages in solving security-constrained unit commitment problems (SCUC) within Lagrangian framework: one is to obtain feasible units' states (UC), the other is power economic dispatch (ED) for each unit. The accurate solution of ED is more important for enhancing the efficiency of the solution to SCUC for the fixed feasible units' statues. Two novel methods named after Convex Combinatorial Coefficient Method and Power Increment Method respectively based on linear programming problem for solving ED are proposed by the piecewise linear approximation to the nonlinear convex fuel cost functions. Numerical testing results show that the methods are effective and efficient.