Skip to content
DraconiticResearch
Search Sources API
201,683 studies31 sourcesUpdated 31 min ago
PreprintarXiv licencearXiv

DistFlow and Its Conic Relaxation: Regularity, Monotonicity, and Hybrid Exactness via Graph Decomposition

Abstract

Classical exactness conditions for conic relaxations of the DistFlow model rely, among other assumptions, either on all nodal injections being adjustable or on a network-wide path condition. In practice, these conditions may not hold uniformly across a feeder: controllable distributed energy resources (DERs) sit at some buses and fixed loads at others, while reverse flows from DER-rich regions can violate the path condition. This paper certifies exactness region by region and composes the regional certificates, accounting for perturbations that propagate downstream through voltages. We first introduce a subtree voltage stability region, in which the network and all compatible subtrees remain regular. Within it, two endpoint sign conditions, one relaxing the nonnegative-flow assumption and one implied by the classical path condition, yield monotone responses of voltages, currents, and losses to root voltages. Using duality, the implicit function theorem, and sign properties of inverse sensitivity matrices, we recast both classical arguments as individual sign certificates on branch multipliers. This turns exactness into a branchwise property that can be certified region by region. A partition rule then splits the network into dispatchable and passive subtrees, and a hybrid certificate combines their local conditions into exactness of the full-network relaxation, under additional operating-limit and objective conditions. In particular, placing controllable DERs at both ends of a branch with large reverse flow exempts that branch from the passive sign conditions.

Related

  1. On Parallel Sums of Set-Valued Operators: Monotonicity, Paramonotonicity, and Decomposition Invariance
    Salihah Thabet Alwadani
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  2. Angular Monotonicity of Completed Dirichlet L-Functions via the Three-Term Zeta Decomposition: A Proof of the Generalized Riemann Hypothesis for Non-Principal Characters
    Zhuo Chen
    Zenodo (CERN European Organization for Nuclear Research)PreprintCC BY5 citedAlgebra & number theoryOpenAlex
  3. Compressible Euler equations with time-dependent damping in the critical regularity setting: global well-posedness and strong relaxation limit
    Timothée Crin-Barat, Xinghong Pan, Ling-Yun Shou +1
    HALPreprintCC BY 4.0Full textGeneral mathematicsHAL
  4. Eventual Exactness and Rigidity for Abelian Covers of Groups
    Guillaume Lecomte
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  5. Exactness and Drinfeld-Sokolov Realization of the McRae-Yang Tensor Functors
    Shun Xu
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
BibTeX
@misc{dai2026distflow,
  title = {{DistFlow and Its Conic Relaxation: Regularity, Monotonicity, and Hybrid Exactness via Graph Decomposition}},
  author = {Xinliang Dai},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.41220},
  eprint = {2610.41220},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.41220},
}
RIS
TY  - UNPB
TI  - DistFlow and Its Conic Relaxation: Regularity, Monotonicity, and Hybrid Exactness via Graph Decomposition
AU  - Xinliang Dai
PY  - 2026
DA  - 2026/10/30
PB  - arXiv
DO  - 10.48550/arxiv.2610.41220
UR  - https://arxiv.org/abs/2610.41220
AB  - Classical exactness conditions for conic relaxations of the DistFlow model rely, among other assumptions, either on all nodal injections being adjustable or on a network-wide path condition. In practice, these conditions may not hold uniformly across a feeder: controllable distributed energy resources (DERs) sit at some buses and fixed loads at others, while reverse flows from DER-rich regions can violate the path condition. This paper certifies exactness region by region and composes the regional certificates, accounting for perturbations that propagate downstream through voltages. We first introduce a subtree voltage stability region, in which the network and all compatible subtrees remain regular. Within it, two endpoint sign conditions, one relaxing the nonnegative-flow assumption and one implied by the classical path condition, yield monotone responses of voltages, currents, and losses to root voltages. Using duality, the implicit function theorem, and sign properties of inverse sensitivity matrices, we recast both classical arguments as individual sign certificates on branch multipliers. This turns exactness into a branchwise property that can be certified region by region. A partition rule then splits the network into dispatchable and passive subtrees, and a hybrid certificate combines their local conditions into exactness of the full-network relaxation, under additional operating-limit and objective conditions. In particular, placing controllable DERs at both ends of a branch with large reverse flow exempts that branch from the passive sign conditions.
ER  -