The DOI matches its Crossref record.
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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
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
Evangelopoulos, V. A., Avramidis, I. I., & Georgilakis, P. S. (2020) · IEEE Access · doi:10.1109/access.2020.2975663 · Cited by 65
Optimal 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
- 0
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Radial Distribution Load Flow Using Conic Programming. https://app.cochat.ai/papers/10.1109/tpwrs.2006.879234
- The paper
- Jabr, R. A. (2006). Radial Distribution Load Flow Using Conic Programming. IEEE Transactions on Power Systems. https://doi.org/10.1109/tpwrs.2006.879234
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.