Geodesic
A Separable Approximation Dynamic Programming Algorithm for Economic Dispatch With Transmission Losses
Yugoslav journal of operations research, Tome 12 (2002) no. 2, p. 157 .

Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

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: Economic dispatch, transmission losses, B-coefficients, penalty factors, separable approximation, dynamic programming. 
@article{YJOR_2002_12_2_a1,
     author = {Pierre Hansen and Nenad Mladenovi\'c},
     title = {A {Separable} {Approximation} {Dynamic} {Programming} {Algorithm} for {Economic} {Dispatch} {With} {Transmission} {Losses}},
     journal = {Yugoslav journal of operations research},
     pages = {157 },
     publisher = {mathdoc},
     volume = {12},
     number = {2},
     year = {2002},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_2002_12_2_a1/}
}
TY  - JOUR
AU  - Pierre Hansen
AU  - Nenad Mladenović
TI  - A Separable Approximation Dynamic Programming Algorithm for Economic Dispatch With Transmission Losses
JO  - Yugoslav journal of operations research
PY  - 2002
SP  - 157 
VL  - 12
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/YJOR_2002_12_2_a1/
LA  - en
ID  - YJOR_2002_12_2_a1
ER  - 
%0 Journal Article
%A Pierre Hansen
%A Nenad Mladenović
%T A Separable Approximation Dynamic Programming Algorithm for Economic Dispatch With Transmission Losses
%J Yugoslav journal of operations research
%D 2002
%P 157 
%V 12
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/YJOR_2002_12_2_a1/
%G en
%F YJOR_2002_12_2_a1
Pierre Hansen; Nenad Mladenović. A Separable Approximation Dynamic Programming Algorithm for Economic Dispatch With Transmission Losses. Yugoslav journal of operations research, Tome 12 (2002) no. 2, p. 157 . http://geodesic.mathdoc.fr/item/YJOR_2002_12_2_a1/