A separable approximation dynamic programming algorithm for economic dispatch with transmission losses

A separable approximation dynamic programming algorithm for economic dispatch with transmission losses

0.00 Avg rating0 Votes
Article ID: iaor20031000
Country: Serbia
Volume: 12
Issue: 2
Start Page Number: 157
End Page Number: 166
Publication Date: Jul 2002
Journal: Yugoslav Journal of Operations Research
Authors: ,
Keywords: programming: dynamic
Abstract:

The standard way to solve the static economic dispatch problem with transmission losses is the penalty factor method. The problem is solved iteratively by a Lagrange multiplier method or by dynamic programming, using values obtained at one iteration to compute penalty factors for the next until stability is attained. A new iterative method is proposed for the case where transmission losses are represented by a quadratic formula (i.e., by the traditional B-coefficients). A separable approximation is made at each iteration, which is much closer to the initial problem than the penalty factor approximation. Consequently, lower cost solutions may be obtained in some cases, and convergence is faster.

Reviews

Required fields are marked *. Your email address will not be published.