Dynamic Economic Dispatch For Large Scale Power Systems: A Lagrangian Relaxation Approach
The dynamic multi-period economic dispatch problem for large-scale power systems is modelled as a linear programming problem. The model considers loading and deloading rates, limits on generators outputs, spinning reserve requirements and group power import-export limits. The solution algorithm is b...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | en |
| Published: |
Elsevier
1991
|
| Subjects: | |
| Online Access: | http://eprints.utem.edu.my/id/eprint/8897/2/P2.pdf http://eprints.utem.edu.my/id/eprint/8897/ https://www.sciencedirect.com/science/article/pii/014206159190018Q https://doi.org/10.1016/0142-0615(91)90018-Q |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The dynamic multi-period economic dispatch problem for large-scale power systems is modelled as a linear programming problem. The model considers loading and deloading rates, limits on generators outputs, spinning reserve requirements and group power import-export limits. The solution algorithm is based on Lagrangian relaxation and on exploiting the intimate relationship between optimizing the dual Lagrangian function and Dantzig-Wolfe decomposition. The relaxation is carried out so that the relaxed problem is decomposable to a number of subproblems corresponding to the periods in the dispatch horizon. These are solved simply by using priority lists. The dual Lagrangian function is optimized using subgradient optization. If an overall solution feasible in all constraints and sufficiently close to a computed best lower bound is discovered during subgradient optimization, it is deemed optimal. Otherwise, Dantzig-Wolfe decomposition is invoked, using almost all the information generated during subgradient optimization to ensure a speedy conclusion. The computational efficiency of the algorithm renders it suitable for on-line dispatch. |
|---|