The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
On Computational Issues of Market-Based Optimal Power Flow
Abstract
The deregulated electricity market calls for robust optimal power flow (OPF) tools that can provide a) deterministic convergence; b) accurate computation of nodal prices; c) support of both smooth and nonsmooth costing of a variety of resources and services, such as real energy, reactive energy, voltages support, etc.; d) full active and reactive power flow modeling of large-scale systems; and e) satisfactory worst-case performance that meets the real-time dispatching requirement. Most prior research on OPF has focused on performance issues in the context of regulated systems, without giving much emphasis to requirements a)-c). This paper discusses the computational challenges brought up by the deregulation and attempts to address them through the introduction of new OPF formulations and algorithms. Trust-region- based augmented Lagrangian method (TRALM), step-controlled primal-dual interior point method (SCIPM), and constrained cost variable (CCV) OPF formulation are proposed. The new formulations and algorithms, along with several existing ones, are tested and compared using large-scale power system models.
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
Practical Methods of Optimization
Fletcher, R. (2000) · Wiley eBooks · doi:10.1002/9781118723203 · Cited by 7,605
Practical methods of optimization
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90129-2 · Cited by 5,818
Nonlinear programming: theory and algorithms
(1993) · Computers & Operations Research · doi:10.1016/0305-0548(93)90042-h · Cited by 5,779
An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
Coleman, T. F., & Li, Y. (1996) · SIAM Journal on Optimization · doi:10.1137/0806023 · Cited by 3,320
Weik, M. H. (2000) · Computer Science and Communications Dictionary · doi:10.1007/1-4020-0613-6_12436 · Cited by 2,570
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
Moré, J. J., & Sorensen, D. C. (1983) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0904038 · Cited by 1,411
Nonlinear Programming — Theory and Algorithms
Ovuworie, G. C. (1979) · Journal of the Operational Research Society · doi:10.1057/jors.1979.231 · Cited by 1,182
Branch, M. A., Coleman, T. F., & Li, Y. (1999) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827595289108 · Cited by 1,083
Practical methods of optimization; (2nd ed.)
Fletcher, R. (1987) · Wiley-Interscience eBooks · Cited by 964
Cited by
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
Self-citationZero 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
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
A new meta-heuristic optimizer: Pathfinder algorithm
Yapici, H., & Cetinkaya, N. (2019) · Applied Soft Computing · doi:10.1016/j.asoc.2019.03.012 · Cited by 339
Yang, Z., Zhong, H., Bose, A., Zheng, T., Xia, Q., & Kang, C. (2018) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2017.2718551 · Cited by 330
Metadata
- Authors
- Wang, H., Murillo-Sanchez, C. E., Zimmerman, R. D., & Thomas, R. J.
- Venue
- IEEE Transactions on Power Systems
- Published
- 2007-08
- Volume
- 22
- Issue
- 3
- Pages
- 1185-1193
- ISSN
- 0885-8950 (ISSN-L)
- OpenAlex
- W2133726159
- Cited by
- 352
- References
- 18
- FWCI
- 11.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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On Computational Issues of Market-Based Optimal Power Flow. https://app.cochat.ai/papers/10.1109/tpwrs.2007.901301
- The paper
- Wang, H., Murillo-Sanchez, C. E., Zimmerman, R. D., & Thomas, R. J. (2007). On Computational Issues of Market-Based Optimal Power Flow. IEEE Transactions on Power Systems. https://doi.org/10.1109/tpwrs.2007.901301
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.