Please use this identifier to cite or link to this item:
Title: A separable approximation dynamic programming algorithm for economic dispatch with transmission losses
Authors: Hansen, P
Mladenović, N
Keywords: Economic dispatch;Transmission losses;B-coefficients;Penalty factors;Separable approximation;Dynamic programming
Issue Date: 2002
Publisher: University of Belgrade
Citation: Yugoslav Journal of Operations Research, 12(2): 157 - 166, 2002
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.
Description: Copyright @ 2002 University of Belgrade - This article can be accessed from the link below.
ISSN: 0354-0243
Appears in Collections:Publications
Computer Science
Dept of Mathematics Research Papers
Mathematical Sciences

Files in This Item:
File Description SizeFormat 
Fulltext.pdf91.33 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.