Decompositions For Optimal Power Flows

The Han-Powell algorithm has proved to be extremely fast and robust for small optimum power flow problems (of the order of 100 buses). However, it balks at full size problems (of the order of 1000 buses). This paper develops a class of decompositions to break large problems down to sizes the Han-Pow...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on power apparatus and systems 1983-12, Vol.PAS-102 (12), p.3877-3884
Main Authors: Talukdar, Sarosh N., Giras, Theo C., Kalyan, Vibhu K.
Format: Article
Language:English
Subjects:
Applied sciences
Cost function
Electrical engineering. Electrical power engineering
Electrical power engineering
Exact sciences and technology
Gold
Hybrid power systems
Lagrangian functions
Load flow
Operation. Load control. Reliability
Power engineering
Power generation
Power networks and lines
Quadratic programming
Regulators
Robustness
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Han-Powell algorithm has proved to be extremely fast and robust for small optimum power flow problems (of the order of 100 buses). However, it balks at full size problems (of the order of 1000 buses). This paper develops a class of decompositions to break large problems down to sizes the Han-Powell algorithm can comfortably tackle. From this class we select one mem- ber-called the Super Hybrid-that seems to work best and describe it in detail.
ISSN:0018-9510
2995-6323
DOI:10.1109/TPAS.1983.317925