Abstract
This paper proposes an improved strategy for on-line rolling generation dispatch. Based on the framework of Lagrange dual relaxation, the problem is transformed and decomposed into primal-problem and N subproblems multipliers and system constrains are satisfied iteratively. The sub-problems are solved by an efficient dynamic programming algorithm without changing the condition of convergence of the framework. Numerical results indicate that the proposed method is fast and efficient in dealing with numerous system constrains.
Publisher
Trans Tech Publications, Ltd.