Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 523

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

Convex Relaxation of Optimal Power Flow—Part II: Exactness

Open access
Low, Steven H.·2014·IEEE Transactions on Control of Network Systems

Abstract

This tutorial summarizes recent advances in the convex relaxation of the optimal power flow (OPF) problem, focusing on structural properties rather than algorithms. Part I presents two power flow models, formulates OPF and their relaxations in each model, and proves equivalence relations among them. Part II presents sufficient conditions under which the convex relaxations are exact.

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.

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

Integrity signals

Registry

Crossref · 10.1109/tcns.2014.2323634

Cites

5 of 5 references verified0 citation errors · 0 not checkable

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.

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

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

Show all 5 references

Cited by

See all 523

Metadata

Authors
Low, S. H.
Venue
IEEE Transactions on Control of Network Systems
Published
2014-06
Volume
1
Issue
2
Pages
177-189
ISSN
2325-5870 (ISSN-L)
OpenAlex
W2170736358
Cited by
523
References
5
FWCI
19.46
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: Convex Relaxation of Optimal Power Flow—Part II: Exactness. https://app.cochat.ai/papers/10.1109/tcns.2014.2323634
The paper
Low, S. H. (2014). Convex Relaxation of Optimal Power Flow—Part II: Exactness. IEEE Transactions on Control of Network Systems. https://doi.org/10.1109/tcns.2014.2323634

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.