Authors: Hansen, Pierre
Mladenović, Nenad 
Title: A separable approximation dynamic programming algorithm for economic dispatch with transmission losses
Journal: Yugoslav Journal of Operations Research
Volume: 12
Issue: 2
First page: 157
Last page: 166
Issue Date: 1-Jan-2002
ISSN: 0354-0243
DOI: 10.2298/YJOR0202157H
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.
Keywords: B-coefficients | Dynamic programming | Economic dispatch | Penalty factors | Separable approximation | Transmission losses
Publisher: Faculty of Organizational Sciences, University of Belgrade

Show full item record


checked on May 16, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




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