The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Branch Flow Model: Relaxations and Convexification—Part II
Open accessAbstract
We propose a branch flow model for the analysis and optimization of mesh as well as radial networks. The model leads to a new approach to solving optimal power flow (OPF) that consists of two relaxation steps. The first step eliminates the voltage and current angles and the second step approximates the resulting problem by a conic program that can be solved efficiently. For radial networks, we prove that both relaxation steps are always exact, provided there are no upper bounds on loads. For mesh networks, the conic relaxation is always exact but the angle relaxation may not be exact, and we provide a simple way to determine if a relaxed solution is globally optimal. We propose convexification of mesh networks using phase shifters so that OPF for the convexified network can always be solved efficiently for an optimal solution. We prove that convexification requires phase shifters only outside a spanning tree of the network and their placement depends only on network topology, not on power flows, generation, loads, or operating constraints. Part I introduces our branch flow model, explains the two relaxation steps, and proves the conditions for exact relaxation. Part II describes convexification of mesh networks, and presents simulation results.
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
Cites
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
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
Self-citationMATPOWER's extensible optimal power flow architecture
Zimmerman, R. D., Murillo-Sanchez, C. E., & Thomas, R. J. (2009) · 2009 IEEE Power & Energy Society General Meeting · doi:10.1109/pes.2009.5275967 · Cited by 265
The Shortest Vector Problem in L 2 is NP-hard for Randomized Reductions.Preprint
Ajtai, M. (1997) · Electronic colloquium on computational complexity · Cited by 243
Flexible AC Transmission Systems: Modelling and Control
(2006) · Power Systems · doi:10.1007/3-540-30607-2 · Cited by 214
Algorithms for the Shortest and Closest Lattice Vector Problems
Hanrot, G., Pujol, X., & Stehlé, D. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20901-7_10 · Cited by 120
Optimal power flow over tree networks
Bose, S., Gayme, D. F., Low, S. H., & Chandy, K. M. (2011) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2011.6120323 · Cited by 91
Self-citationBranch flow model: Relaxations and convexification
Farivar, M., & Low, S. H. (2012) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6425870 · Cited by 89
Self-citation
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
Self-citationA 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
Self-citationConvex 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
Self-citationLei, S., Chen, C., Li, Y., & Hou, Y. (2019) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2019.2899353 · Cited by 427
Ding, T., Liu, S., Yuan, W., Bie, Z., & Zeng, B. (2016) · IEEE Transactions on Sustainable Energy · doi:10.1109/tste.2015.2494587 · Cited by 423
Metadata
- Authors
- Farivar, M., & Low, S. H.
- Venue
- IEEE Transactions on Power Systems
- Published
- 2013-08
- Volume
- 28
- Issue
- 3
- Pages
- 2565-2572
- ISSN
- 0885-8950 (ISSN-L)
- 1558-0679
- OpenAlex
- W4249837196
- Cited by
- 287
- References
- 8
- FWCI
- 10.98
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Branch Flow Model: Relaxations and Convexification—Part II. https://app.cochat.ai/papers/10.1109/tpwrs.2013.2255318
- The paper
- Farivar, M., & Low, S. H. (2013). Branch Flow Model: Relaxations and Convexification—Part II. IEEE Transactions on Power Systems. https://doi.org/10.1109/tpwrs.2013.2255318
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.