The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Chance-Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty
Open accessAbstract
When uncontrollable resources fluctuate, optimal power flow (OPF), routinely used by the electric power industry to redispatch hourly controllable generation (coal, gas, and hydro plants) over control areas of transmission networks, can result in grid instability and, potentially, cascading outages. This risk arises because OPF dispatch is computed without awareness of major uncertainty, in particular fluctuations in renewable output. As a result, grid operation under OPF with renewable variability can lead to frequent conditions where power line flow ratings are significantly exceeded. Such a condition, which is borne by our simulations of real grids, is considered undesirable in power engineering practice. Possibly, it can lead to a risky outcome that compromises grid stability---line tripping. Smart grid goals include a commitment to large penetration of highly fluctuating renewables, thus calling to reconsider current practices, in particular the use of standard OPF. Our chance-constrained (CC) OPF corrects the problem and mitigates dangerous renewable fluctuations with minimal changes in the current operational procedure. Assuming availability of a reliable wind forecast parameterizing the distribution function of the uncertain generation, our CC-OPF satisfies all the constraints with high probability while simultaneously minimizing the cost of economic redispatch. CC-OPF allows efficient implementation, e.g., solving a typical instance over the 2746-bus Polish network in 20 seconds on a standard laptop.
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.
Integrity signals
Registry
Cites
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.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Power System Stability and Control
Kundur, P. (1994) · Cited by 19,639
Zimmerman, R. D., Murillo-Sanchez, C. E., & Thomas, R. J. (2011) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2010.2051168 · Cited by 6,756
Bertsimas, D., & Sim, M. (2004) · Operations Research · doi:10.1287/opre.1030.0065 · Cited by 4,557
Handbook of Mathematical Functions with Formulas
Owen, D. B. (1965) · Technometrics · doi:10.1080/00401706.1965.10490234 · Cited by 4,021
Geometric Algorithms and Combinatorial Optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1988) · Algorithms and Combinatorics · doi:10.1007/978-3-642-97881-4 · Cited by 3,431
Grainger, J. J., & Stevenson, W. D. (1994) · Cited by 2,754
Robust solutions of Linear Programming problems contaminated with uncertain data
Ben-Tal, A., & Nemirovski, A. (2000) · Mathematical Programming · doi:10.1007/pl00011380 · Cited by 1,744
The Cutting-Plane Method for Solving Convex Programs
Kelley, Jr. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108053 · Cited by 1,549
Alizadeh, F., & Goldfarb, D. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0339-5 · Cited by 1,500
Hill, P. G. (1977) · Cited by 1,394
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 Approximations of Chance Constrained Programs
Nemirovski, A., & Shapiro, A. (2007) · SIAM Journal on Optimization · doi:10.1137/050622328 · Cited by 1,160
Security-Constrained Unit Commitment With Volatile Wind Power Generation
Wang, J., Shahidehpour, M., & Li, Z. (2008) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2008.926719 · Cited by 914
Robust Portfolio Selection Problems
Goldfarb, D., & Iyengar, G. (2003) · Mathematics of Operations Research · doi:10.1287/moor.28.1.1.14260 · Cited by 895
Synchronization in complex oscillator networks and smart grids
Dörfler, F., Chertkov, M., & Bullo, F. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1212134110 · Cited by 879
Self-citationStatistical Analysis of Wind Power Forecast Error
Bludszuweit, H., Dominguez-Navarro, J. A., & Llombart, A. (2008) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2008.922526 · Cited by 749
Cost Horizons and Certainty Equivalents: An Approach to Stochastic Programming of Heating Oil
Charnes, A., Cooper, W. W., & Symonds, G. H. (1958) · Management Science · doi:10.1287/mnsc.4.3.235 · Cited by 623
Operational Impacts of Wind Generation on California Power Systems
Makarov, Y. V., Loutan, C., Ma, J., & de Mello, P. (2009) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2009.2016364 · Cited by 614
A survey of the optimal power flow literature
Huneault, M., & Galiana, F. D. (1991) · IEEE Transactions on Power Systems · doi:10.1109/59.76723 · Cited by 603
Cascading dynamics and mitigation assessment in power system disturbances via a hidden failure model
Chen, J., Thorp, J. S., & Dobson, I. (2005) · International Journal of Electrical Power & Energy Systems · doi:10.1016/j.ijepes.2004.12.003 · Cited by 501
Criticality in a cascading failure blackout model
Nedic, D. P., Dobson, I., Kirschen, D. S., Carreras, B. A., & Lynch, V. E. (2006) · International Journal of Electrical Power & Energy Systems · doi:10.1016/j.ijepes.2006.03.006 · Cited by 336
Eppstein, M. J., & Hines, P. D. H. (2012) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2012.2183624 · Cited by 309
Ambiguous chance constrained problems and robust optimization
Erdoğan, E., & Iyengar, G. (2006) · Mathematical Programming · doi:10.1007/s10107-005-0678-0 · Cited by 302
Wind power forecasting error distributions over multiple timescales
Hodge, B.-M., & Milligan, M. (2011) · 2011 IEEE Power and Energy Society General Meeting · doi:10.1109/pes.2011.6039388 · Cited by 297
Potential Function Methods for Approximately Solving Linear Programming Problems
(2002) · International Series in Operations Research & Management Science · doi:10.1007/b115460 · Cited by 291
A Solution to the Stochastic Unit Commitment Problem Using Chance Constrained Programming
Öztürk, U. A., Mazumdar, M., & Norman, B. A. (2004) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2004.831651 · Cited by 243
Power grid vulnerability to geographically correlated failures — Analysis and control implications
Bernstein, A., Bienstock, D., Hay, D., Uzunoglu, M., & Zussman, G. (2014) · doi:10.1109/infocom.2014.6848211 · Cited by 155
Self-citationAnalytical reformulation of security constrained optimal power flow with probabilistic constraints
Roald, L., Oldewurtel, F., Krause, T., & Andersson, G. (2013) · IEEE Grenoble Conference · doi:10.1109/ptc.2013.6652224 · Cited by 125
Optimal control of cascading power grid failures
Bienstock, D. (2011) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2011.6160415 · Cited by 87
Self-citationTransmission Network Expansion Planning With Complex Power Flow Models
Bent, R. W., Toole, G. L., & Berscheid, A. P. (2011) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2011.2169994 · Cited by 50
Dynamic Competitive Equilibria in Electricity Markets
Wang, G., Negrete-Pincetic, M., Kowli, A. S., Shafieepoorfard, E., Meyn, S., & Shanbhag, U. V. (2011) · Springer eBooks · doi:10.1007/978-1-4614-1605-0_2 · Cited by 48
Message Passing for Dynamic Network Energy ManagementPreprint
Kraning, M., Chu, E., Lavaei, J., & Boyd, S. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1204.1106 · Cited by 44
Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations
Bienstock, D., & Iyengar, G. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539705447293 · Cited by 32
Self-citation
Cited by
JuMP: A Modeling Language for Mathematical Optimization
Dunning, I., Huchette, J., & Lubin, M. (2017) · SIAM Review · doi:10.1137/15m1020575 · Cited by 1,250
The QC Relaxation: A Theoretical and Computational Study on Optimal Power Flow
Coffrin, C., Hijazi, H. L., & Van Hentenryck, P. (2016) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2015.2463111 · Cited by 341
Power systems optimization under uncertainty: A review of methods and applications
Roald, L. A., Pozo, D., Papavasiliou, A., Molzahn, D. K., Kazempour, J., & Conejo, A. (2023) · Electric Power Systems Research · doi:10.1016/j.epsr.2022.108725 · Cited by 317
Zhang, Y., Shen, S., & Mathieu, J. (2016) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2016.2572104 · Cited by 278
A Survey of Relaxations and Approximations of the Power Flow Equations
Molzahn, D. K., & Hiskens, I. A. (2019) · Foundations and Trends® in Electric Energy Systems · doi:10.1561/3100000012 · Cited by 272
Metadata
- Authors
- Bienstock, D., Chertkov, M., & Harnett, S.
- Venue
- SIAM Review
- Published
- 2014-01
- Volume
- 56
- Issue
- 3
- Pages
- 461-495
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2000587848
- Cited by
- 496
- References
- 34
- FWCI
- 23.17
- Type
- journal article
- Language
- en
- Open access
- green
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.