The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Further developments in LP-based optimal power flow
Abstract
The authors describe developments that have transformed the LP (linear programming) approach into a truly general-purpose OPF (optimal power flow) solver, with computational and other advantages over even recent nonlinear programming (NLP) methods. it is pointed out that the nonseparable loss-minimization problem can now be solved, giving the same results as NLP on power systems of any size and type. Coupled formulations, where for instance voltages and VAr become constraints on MW scheduling, are handled. Former limitations on the modeling of generator cost curves have been eliminated. In addition, the approach accommodates a large variety of power system operating limits, including the very important category of contingency constraints. All of the reported enhancements are fully implemented in the production OPF software described here, and most have already been utilized within the industry.>
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 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
Self-citationOptimal 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
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
Security analysis and optimization
Stott, B., Alsac, O., & Monticelli, A. J. (1987) · Proceedings of the IEEE · doi:10.1109/proc.1987.13931 · Cited by 553
Self-citationPower 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
Self-citation
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
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
Optimal reactive dispatch through interior point methods
Granville, S. (1994) · IEEE Transactions on Power Systems · doi:10.1109/59.317548 · Cited by 876
Optimal power flow: a bibliographic survey I: Formulations and deterministic methods
Frank, S., Steponavice, I., & Rebennack, S. (2012) · Energy Systems · doi:10.1007/s12667-012-0056-y · Cited by 554
Exact Convex Relaxation of Optimal Power Flow in Radial Networks
Gan, L., Li, N., Topcu, U., & Low, S. H. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2332712 · Cited by 500
Ding, T., Liu, S., Yuan, W., Bie, Z., & Zeng, B. (2016) · IEEE Transactions on Sustainable Energy · doi:10.1109/tste.2015.2494587 · Cited by 423
An interior point nonlinear programming for optimal power flow problems with a novel data structure
Wei, H., Sasaki, H., Kubokawa, J., & Yokoyama, R. (1998) · IEEE Transactions on Power Systems · doi:10.1109/59.708745 · Cited by 383
A Fully Distributed Reactive Power Optimization and Control Method for Active Distribution Networks
Zheng, W., Wu, W., Zhang, B., Sun, H., & Liu, Y. (2015) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2015.2396493 · Cited by 371
Optimal power flow solution in power systems using a novel Sine-Cosine algorithm
Attia, A.-F., El Sehiemy, R. A., & Hasanien, H. M. (2018) · International Journal of Electrical Power & Energy Systems · doi:10.1016/j.ijepes.2018.01.024 · Cited by 361
On Computational Issues of Market-Based Optimal Power Flow
Wang, H., Murillo-Sanchez, C. E., Zimmerman, R. D., & Thomas, R. J. (2007) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2007.901301 · Cited by 352
A comparison of the AC and DC power flow models for LMP calculations
Overbye, T. J., Cheng, X., & Sun, Y. (2004) · 37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the · doi:10.1109/hicss.2004.1265164 · Cited by 329
An introduction to optimal power flow: Theory, formulation, and examples
Frank, S., & Rebennack, S. (2016) · IIE Transactions · doi:10.1080/0740817x.2016.1189626 · Cited by 254
Voltage Optimization in PV-Rich Distribution Networks—A Review
Dubravac, M., Fekete, K., Topić, D., & Barukčić, M. (2022) · Applied Sciences · doi:10.3390/app122312426 · Cited by 26
Metadata
- Authors
- Alsac, O., Bright, J., Prais, M., & Stott, B.
- Venue
- IEEE Transactions on Power Systems
- Published
- 1990
- Volume
- 5
- Issue
- 3
- Pages
- 697-711
- ISSN
- 0885-8950 (ISSN-L)
- OpenAlex
- W1987243715
- Cited by
- 527
- References
- 5
- FWCI
- 9.52
- 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.