Metraipolis › archive › dc_6ff5787ab36d

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

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41220
License (as archived)
CC0-1.0
Archived
2026-11-03T05:43:11.469Z
SHA-256 of the archived text
a8976f5348f2f30da69a2728143ada27729665db48a08a7b6e30d8462cc23cb7
Stable URL of this page
https://metraipolis.com/documento/dc_6ff5787ab36d

How to cite

DistFlow and Its Conic Relaxation: Regularity, Monotonicity, and Hybrid Exactness via Graph Decomposition — arXiv:2610.41220 — arXiv (en), https://arxiv.org/abs/2610.41220 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6ff5787ab36d (Metraipolis archive dc_6ff5787ab36d, sha256 a8976f5348f2f30da69a2728143ada27729665db48a08a7b6e30d8462cc23cb7)
BibTeX
@misc{dc6ff5787ab36d,
  title = {DistFlow and Its Conic Relaxation: Regularity, Monotonicity, and Hybrid Exactness via Graph Decomposition — arXiv:2610.41220},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41220},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6ff5787ab36d; sha256 a8976f5348f2f30da69a2728143ada27729665db48a08a7b6e30d8462cc23cb7},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41220. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC) ; Systems and Control (eess.SY).
Pagina del lavoro: https://arxiv.org/abs/2610.41220 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T05:31:17.158Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).