The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Radial Distribution Load Flow Using Conic Programming
Abstract
This paper shows that the load flow problem of a radial distribution system can be modeled as a convex optimization problem, particularly a conic program. The implications of the conic programming formulation are threefold. First, the solution of the distribution load flow problem can be obtained in polynomial time using interior-point methods. Second, numerical ill-conditioning can be automatically alleviated by the use of scaling in the interior-point algorithm. Third, the conic formulation facilitates the inclusion of the distribution power flow equations in radial system optimization problems. A state-of-the-art implementation of an interior-point method for conic programming is used to obtain the solution of nine different distribution systems. Comparisons are carried out with a previously published radial load flow program by R. Cespedes
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Network reconfiguration in distribution systems for loss reduction and load balancing
Baran, M. E., & Wu, F. F. (1989) · IEEE Transactions on Power Delivery · doi:10.1109/61.25627 · Cited by 5,077
Network Reconfiguration in Distribution Systems for Loss Reduction and Load Balancing
Baran, M. E., & Wu, F. F. (1989) · IEEE Power Engineering Review · doi:10.1109/mper.1989.4310642 · Cited by 3,350
On implementing a primal-dual interior-point method for conic quadratic optimization
Andersen, E. D., Roos, C., & Tamás Terlaky, B. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0349-3 · Cited by 674
Simple and efficient method for load flow solution of radial distribution networks
Das, D., Kothari, D. P., & Kalam, A. (1995) · International Journal of Electrical Power & Energy Systems · doi:10.1016/0142-0615(95)00050-0 · Cited by 647
Voltage stability analysis of radial distribution networks
Chakravorty, M., & Das, D. (2001) · International Journal of Electrical Power & Energy Systems · doi:10.1016/s0142-0615(00)00040-5 · Cited by 596
New method for the analysis of distribution networks
Cespedes, R. G. (1990) · IEEE Transactions on Power Delivery · doi:10.1109/61.107303 · Cited by 355
Novel method for solving radial distribution networks
Das, D. (1994) · IEE Proceedings - Generation, Transmission and Distribution · doi:10.1049/ip-gtd:19949966 · Cited by 347
Load-Flow Solutions for Ill-Conditioned Power Systems by a Newton-Like Method
Tripathy, S. C., Prasad, G., Malik, O. P., & Hope, G. S. (1982) · IEEE Transactions on Power Apparatus and Systems · doi:10.1109/tpas.1982.317050 · Cited by 210
Reliable load flow technique for radial distribution networks
Gomez Exposito, A., & Romero Ramos, E. (1999) · IEEE Transactions on Power Systems · doi:10.1109/59.780924 · Cited by 159
Cited by
Branch Flow Model: Relaxations and Convexification—Part I
Farivar, M., & Low, S. H. (2013) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2013.2255317 · Cited by 1,541
“I. INTRODUCTION”
A Survey of Distributed Optimization and Control Algorithms for Electric Power Systems
Molzahn, D. K., Dorfler, F., Sandberg, H., Low, S. H., Chakrabarti, S., Baldick, R., & Lavaei, J. (2017) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2017.2720471 · Cited by 1,273
Zero Duality Gap in Optimal Power Flow Problem
Lavaei, J., & Low, S. H. (2012) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2011.2160974 · Cited by 1,195
Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
Low, S. H. (2014) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2014.2309732 · Cited by 929
Convex Relaxation of Optimal Power Flow—Part II: Exactness
Low, S. H. (2014) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2014.2323634 · Cited by 523
Exact Convex Relaxation of Optimal Power Flow in Radial Networks
Gan, L., Li, N., Topcu, U., & Low, S. H. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2332712 · Cited by 500
Convex relaxations and linear approximation for optimal power flow in multiphase radial networks
Gan, L., & Low, S. H. (2014) · 2014 Power Systems Computation Conference · doi:10.1109/pscc.2014.7038399 · Cited by 416
A Fully Distributed Reactive Power Optimization and Control Method for Active Distribution Networks
Zheng, W., Wu, W., Zhang, B., Sun, H., & Liu, Y. (2015) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2015.2396493 · Cited by 371
The QC Relaxation: A Theoretical and Computational Study on Optimal Power Flow
Coffrin, C., Hijazi, H. L., & Van Hentenryck, P. (2016) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2015.2463111 · Cited by 341
Power systems optimization under uncertainty: A review of methods and applications
Roald, L. A., Pozo, D., Papavasiliou, A., Molzahn, D. K., Kazempour, J., & Conejo, A. (2023) · Electric Power Systems Research · doi:10.1016/j.epsr.2022.108725 · Cited by 317
Strong SOCP Relaxations for the Optimal Power Flow Problem
Kocuk, B., Dey, S. S., & Sun, X. A. (2016) · Operations Research · doi:10.1287/opre.2016.1489 · Cited by 281
Devi, S., & Geethanjali, M. (2014) · International Journal of Electrical Power & Energy Systems · doi:10.1016/j.ijepes.2014.05.015 · Cited by 278
A Survey of Relaxations and Approximations of the Power Flow Equations
Molzahn, D. K., & Hiskens, I. A. (2019) · Foundations and Trends® in Electric Energy Systems · doi:10.1561/3100000012 · Cited by 272
AC-feasibility on tree networks is NP-hard
Lehmann, K., Grastien, A., & Van Hentenryck, P. (2016) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2015.2407363 · Cited by 221
Quadratically constrained quadratic programs on acyclic graphs with application to power flow
Bose, S., Gayme, D. F., Chandy, K. M., & Low, S. H. (2012) · arXiv · doi:10.48550/arxiv.1203.5599 · Cited by 131
Evangelopoulos, V. A., Avramidis, I. I., & Georgilakis, P. S. (2020) · IEEE Access · doi:10.1109/access.2020.2975663 · Cited by 65
“The computational performance could be improved by employing convex relaxations of the AC power flow equations, such as the semi-definite programming relaxation [39], the second order cone relaxation [40]–[41], and the quadratic convex relaxation [42].”
BackgroundOptimal power flow in distribution networks
(2018) · Metaheuristic Optimization in Power Engineering · doi:10.1049/pbpo131e_ch9 · Cited by 15
Gupta, R. K., Fahmy, S., Chevron, M., Vasapollo, R., Figini, E., & Paolone, M. (2024) · arXiv · doi:10.48550/arxiv.2404.12863 · Cited by 1
“The grid constraints are accounted for by a linearized optimal power flow (LOPF) model from [13] which is generic enough to be applied to either meshed or radial grid configurations compared to OPF relaxations such as [32].”
Method
Metadata
- Authors
- Jabr, R. A.
- Venue
- IEEE Transactions on Power Systems
- Published
- 2006-08
- Volume
- 21
- Issue
- 3
- Pages
- 1458-1459
- ISSN
- 0885-8950 (ISSN-L)
- OpenAlex
- W2133919892
- Cited by
- 713
- References
- 9
- FWCI
- 3.71
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.