DC FieldValueLanguage
dc.contributor.authorHansen, Pierreen
dc.contributor.authorMladenović, Nenaden
dc.date.accessioned2020-05-02T16:42:16Z-
dc.date.available2020-05-02T16:42:16Z-
dc.date.issued2002-01-01en
dc.identifier.issn0354-0243en
dc.description.abstractThe 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.en
dc.publisherFaculty of Organizational Sciences, University of Belgrade-
dc.relation.ispartofYugoslav Journal of Operations Researchen
dc.subjectB-coefficients | Dynamic programming | Economic dispatch | Penalty factors | Separable approximation | Transmission lossesen
dc.titleA separable approximation dynamic programming algorithm for economic dispatch with transmission lossesen
dc.typeArticleen
dc.identifier.doi10.2298/YJOR0202157Hen
dc.identifier.scopus2-s2.0-24744439874en
dc.relation.firstpage157en
dc.relation.lastpage166en
dc.relation.issue2en
dc.relation.volume12en
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
crisitem.author.orcid0000-0001-6655-0409-
Show simple item record

SCOPUSTM   
Citations

5
checked on Nov 27, 2022

Page view(s)

31
checked on Nov 28, 2022

Google ScholarTM

Check

Altmetric

Altmetric


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