The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Optimal Power Flow Solutions
Abstract
A practical method is given for solving the power flow problem with control variables such as real and reactive power and transformer ratios automatically adjusted to minimize instantaneous costs or losses. The solution is feasible with respect to constraints on control variables and dependent variables such as load voltages, reactive sources, and tie line power angles. The method is based on power flow solution by Newton's method, a gradient adjustment algorithm for obtaining the minimum and penalty functions to account for dependent constraints. A test program solves problems of 500 nodes. Only a small extension of the power flow program is required to implement the method.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A Rapidly Convergent Descent Method for Minimization
Fletcher, R., & Powell, M. J. D. (1963) · The Computer Journal · doi:10.1093/comjnl/6.2.163 · Cited by 4,583
Power Flow Solution by Newton's Method
Tinney, W., & Hart, C. (1967) · IEEE Transactions on Power Apparatus and Systems · doi:10.1109/tpas.1967.291823 · Cited by 1,215
Self-citationDirect solutions of sparse network equations by optimally ordered triangular factorization
Tinney, W. F., & Walker, J. (1967) · Proceedings of the IEEE · doi:10.1109/proc.1967.6011 · Cited by 811
Self-citationBuehler, R. J., & Wilde, D. J. (1965) · Econometrica · doi:10.2307/1909808 · Cited by 695
A Review of Minimization Techniques for Nonlinear Functions
Spang, H. A. (1962) · SIAM Review · doi:10.1137/1004089 · Cited by 162
Some Algorithms for Minimizing a Function of Several Variables
Shah, B. V., Buehler, R. J., & Kempthorne, O. (1964) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0112007 · Cited by 94
Cited by
Optimal Load Flow with Steady-State Security
Alsac, O., & Stott, B. (1974) · IEEE Transactions on Power Apparatus and Systems · doi:10.1109/tpas.1974.293972 · Cited by 1,557
Optimal power flow using particle swarm optimization
Abido, M. A. (2002) · International Journal of Electrical Power & Energy Systems · doi:10.1016/s0142-0615(01)00067-9 · Cited by 1,212
Optimal Power Flow By Newton Approach
Sun, D., Ashley, B., Brewer, B., Hughes, A., & Tinney, W. (1984) · IEEE Transactions on Power Apparatus and Systems · doi:10.1109/tpas.1984.318284 · Cited by 942
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
Optimal reactive dispatch through interior point methods
Granville, S. (1994) · IEEE Transactions on Power Systems · doi:10.1109/59.317548 · Cited by 876
Metadata
- Authors
- Dommel, H., & Tinney, W.
- Venue
- IEEE Transactions on Power Apparatus and Systems
- Published
- 1968-10
- Volume
- PAS-87
- Issue
- 10
- Pages
- 1866-1876
- ISSN
- 0018-9510 (ISSN-L)
- OpenAlex
- W2095570364
- Cited by
- 1,664
- References
- 6
- FWCI
- 16.92
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.