The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
A review of selected optimal power flow literature to 1993. II. Newton, linear programming and interior point methods
Abstract
For pt.II see ibid., vol.14, no.1, p.96-104 (1999). This second of a two part paper offers a survey of literature on optimal power flow from 1968-93. This part treats Newton-based, linear programming and interior point methods of solution.
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
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
Optimal reactive dispatch through interior point methods
Granville, S. (1994) · IEEE Transactions on Power Systems · doi:10.1109/59.317548 · Cited by 876
Security-Constrained Optimal Power Flow with Post-Contingency Corrective Rescheduling
Monticelli, A., Pereira, M. V. F., & Granville, S. (1987) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.1987.4335095 · Cited by 664
Optimal power dispatchߞA comprehensive survey
Happ, H. H. (1977) · IEEE Transactions on Power Apparatus and Systems · doi:10.1109/t-pas.1977.32397 · Cited by 310
Optimal power dispatch: a comprehensive survey
Happ, H. L. (1977) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · Cited by 270
Power System Security Control Calculations Using Linear Programming, Part I
Stott, B., & Hobson, E. (1978) · IEEE Transactions on Power Apparatus and Systems · doi:10.1109/tpas.1978.354664 · Cited by 255
Decoupled Optimal Load Flow Using Linear or Quadratic Programming
Contaxis, G. C., Delkis, C., & Korres, G. N. (1986) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.1986.4334888 · Cited by 88
Network constrained security control using an interior point algorithm
Lu, C., & Unum, M. (1993) · IEEE Transactions on Power Systems · doi:10.1109/59.260892 · Cited by 51
Cited by
Branch Flow Model: Relaxations and Convexification—Part I
Farivar, M., & Low, S. H. (2013) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2013.2255317 · Cited by 1,541
A Survey of Distributed Optimization and Control Algorithms for Electric Power Systems
Molzahn, D. K., Dorfler, F., Sandberg, H., Low, S. H., Chakrabarti, S., Baldick, R., & Lavaei, J. (2017) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2017.2720471 · Cited by 1,273
Zero Duality Gap in Optimal Power Flow Problem
Lavaei, J., & Low, S. H. (2012) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2011.2160974 · Cited by 1,195
Convex 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
A Survey of Particle Swarm Optimization Applications in Electric Power Systems
AlRashidi, M. R., & El-Hawary, M. E. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2006.880326 · Cited by 720
Self-citation
Metadata
- Authors
- Momoh, J. A., El-Hawary, M. E., & Adapa, R.
- Venue
- IEEE Transactions on Power Systems
- Published
- 1999
- Volume
- 14
- Issue
- 1
- Pages
- 105-111
- ISSN
- 0885-8950 (ISSN-L)
- OpenAlex
- W2134869843
- Cited by
- 645
- References
- 8
- FWCI
- 5.34
- 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.