Name
Abstract | ||
|---|---|---|
The optimal power flow problem is concerned with finding a proper operating point for a power network while attempting to minimize a cost function and satisfy network constraints. We analyze the optimal power flow problem subject to contingency constraints and investigate the relationship between the cost of the optimal power flow problem and network topology. We find that when the network topology is that of a small world graph or a scale-free graph, the optimal power flow problem is robust in terms of satisfying contingency constraints. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/ISCAS.2012.6271569 | 2012 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS 2012) |
Keywords | Field | DocType |
network topology,generators,robustness,mathematical model,reactive power | Mathematical optimization,Computer science,Control theory,Operating point,Robustness (computer science),AC power,Network topology,Complex network,Multi-commodity flow problem,Minimum-cost flow problem,Contingency | Conference |
ISSN | Citations | PageRank |
0271-4302 | 0 | 0.34 |
References | Authors | |
1 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Baha Alzalg | 1 | 0 | 0.34 |
| Catalina Anghel | 2 | 6 | 0.88 |
| Wenying Gan | 3 | 0 | 0.34 |
| Qing Huang | 4 | 9 | 3.59 |
| Mustazee Rahman | 5 | 17 | 3.25 |
| Alex Shum | 6 | 7 | 1.27 |
| Chai Wah Wu | 7 | 330 | 67.62 |