Cited by 118Optimal Power Flow DistributionElectric Power System OptimizationPower System Optimization and Stability

Geometry of injection regions of power networks

Open access
Zhang, Baosen, Tse, David·2013·IEEE Transactions on Power Systems

Abstract

We investigate the constraints on power flow in networks and its implications to the optimal power flow problem. The constraints are described by the injection region of a network; this is the set of all vectors of power injections, one at each bus, that can be achieved while satisfying the network and operation constraints. If there are no operation constraints, we show the injection region of a network is the set of all injections satisfying the conservation of energy. If the network has a tree topology, e.g., a distribution network, we show that under voltage magnitude, line loss constraints, line flow constraints and certain bus real and reactive power constraints, the injection region and its convex hull have the same Pareto-front. The Pareto-front is of interest since these are the optimal solutions to the minimization of increasing functions over the injection region. For non-tree networks, we obtain a weaker result by characterizing the convex hull of the voltage constraint injection region for lossless cycles and certain combinations of cycles and trees.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tpwrs.2012.2208205

Cites

22 of 22 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Prior sufficient conditions for exactness of the SOCP relaxation require load over-satisfaction on some or all buses and do not hold in practice.

    “these conditions require some bus to be able to draw infinite power, which is referred to as load over-satisfaction in the literature. For example, the conditions given in [9], [13], [14] require load over-satisfaction on some/all of the buses.”

    From Optimal power flow in distribution networks (2018) · cites this paper as [13]

    Theorem 2 (section IV.A; page not supplied) relates the paper’s lower-bound conditions to load over-satisfaction, supporting that part of the attribution. But the Introduction explicitly says simulations with practical distribution networks show these requirements are “not stringent in actual operations,” contrary to the claim that they do not hold in practice. (LLM, conf=0.87)

    Checked by a reasoning model — may be wrong.

    Experimental — accuracy not yet measured
  • All sufficient conditions in the literature that guarantee exactness of the SOCP relaxation require removing some of the constraints in OPF, and do not hold in practice.

    “To summarize, all sufficient conditions in the literature that guarantee the exactness of the SOCP relaxation require removing some of the constraints in OPF, and do not hold in practice.”

    From Optimal power flow in distribution networks (2018) · cites this paper as [13]

    The Introduction (page unavailable) says the paper's conditions retain voltage, line-loss, and line-flow constraints, restrict certain bus-power bounds, and are 'not stringent in actual operations'—contrary to the claim that such conditions do not hold in practice. The paper discusses a convex relaxation; these passages do not identify it specifically as an SOCP relaxation or establish a claim about every sufficient condition in the literature. (LLM, conf=0.82)

    Checked by a reasoning model — may be wrong.

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 5

  1. B. Stott, O. Alsac, and A. J. Monticelli, "Security analysis and opti- mization," Proceedings of the IEEE, 1987.
  2. R. V. Amarnath and N. V. Ramana, "State of the art in optimal power flow solution methodologies," Journal of Theoretical and Applied Information Technology, vol. 30, no. 2, pp. 128-154, 2011.
  3. S. Sojoudi and J. Lavaei, "Network topologies guaranteeing zero duality gap for optimal power flow problem," Submitted to IEEE Transactions on Power Systems, 2011.
  4. Distribution Test Feeder Working Group, "Distribution test feeders," http://ewh.ieee.org/soc/pes/dsacom/testfeeders/index.html, 2010.
  5. H. L. Bodlaender, "A linear time algorithm for finding tree- decompositions of small treewidth," SIAM Journal on Computing, 1996.

Cited by

Sorted by citations

Authors
Zhang, B., & Tse, D.
Affiliations
University of California, Berkeley (US)
Venue
IEEE Transactions on Power Systems
Published
2013-05
Volume
28
Issue
2
Pages
788-797
ISSN
  • 0885-8950 (ISSN-L)
  • 1558-0679
OpenAlex
W2145367961
Cited by
118
References
22
Citations by year
2026: 1 · 2025: 4 · 2024: 3 · 2023: 2 · 2022: 4 · 2021: 8 · 2020: 7 · 2019: 8 · 2018: 10 · 2017: 10 · 2016: 17 · 2015: 10 · 2014: 19 · 2013: 14 · 2012: 1
FWCI
9.00
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Power Systems (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Optimal Power Flow Distribution
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Electric Power System Optimization
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Power System Optimization and Stability
Keywords
power flow constraints, optimal power flow, Pareto front, convex hull, power network topology, tree networks, distribution networks, voltage magnitude constraints, line flow constraints

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