Pith. sign in

REVIEW 12 cited by

The Power Grid Library for Benchmarking AC Optimal Power Flow Algorithms

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1908.02788 v2 pith:7R7ZQBAO submitted 2019-08-07 math.OC

classification math.OC
keywords ac-opfpowerbenchmarkingalgorithmsflownetworkpglib-opfdata
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In recent years, the power systems research community has seen an explosion of novel methods for formulating the AC power flow equations. Consequently, benchmarking studies using the seminal AC Optimal Power Flow (AC-OPF) problem have emerged as the primary method for evaluating these emerging methods. However, it is often difficult to directly compare these studies due to subtle differences in the AC-OPF problem formulation as well as the network, generation, and loading data that are used for evaluation. To help address these challenges, this IEEE PES Task Force report proposes a standardized AC-OPF mathematical formulation and the PGLib-OPF networks for benchmarking AC-OPF algorithms. A motivating study demonstrates some limitations of the established network datasets in the context of benchmarking AC-OPF algorithms and a validation study demonstrates the efficacy of using the PGLib-OPF networks for this purpose. In the interest of scientific discourse and future additions, the PGLib-OPF benchmark library is open-access and all the of network data is provided under a creative commons license.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 12 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 210 citations worldwide. Full citation record

  1. The Limits of Quantum Computers for Power Flow

    quant-ph 2026-07 conditional novelty 6.0 of 10

    Balanced separators and corridors in transmission grids force the DC susceptance matrix condition number to grow polynomially, ruling out end-to-end quantum advantage at any readout level.

  2. Scenario Reduction for Two-Stage Stochastic Mixed-Integer Programs

    math.OC 2026-07 conditional novelty 6.0 of 10

    A new asymmetric regret cost function for scenario reduction provably picks the single best scenario and, with a hybrid pre-selection, matches its accuracy at a fraction of the compute.

  3. De-risking solutions to optimization problems

    math.OC 2026-05 unverdicted novelty 6.0 of 10

    A softmax-based cutting-plane method de-risks solutions of generic optimization problems by reducing an impact metric with limited cost increase, or certifies impossibility.

  4. Activate the Dual Cones: A Tight Reformulation of Conic ACOPF Constraints

    eess.SY 2026-03 conditional novelty 6.0 of 10

    The dual rotated second-order cone constraints of the Jabr ACOPF relaxation are always active at optimality, which lets the paper replace them with equality constraints and produce a certified lower bound.

  5. Constrained Diffusion Models for Synthesizing Representative Power Flow Datasets

    cs.LG 2025-06 conditional novelty 6.0 of 10

    A physics-guided diffusion model produces synthetic power flow samples that are more AC-feasible and slightly closer to ground truth than unconstrained diffusion on IEEE 5, 24, and 118 bus systems.

  6. PGLearn -- An Open-Source Learning Toolkit for Optimal Power Flow

    cs.LG 2025-05 conditional novelty 6.0 of 10

    PGLearn provides a large open-source dataset collection and toolkit with AC, DC, and SOC-OPF primal and dual solutions, time-series data for large grids, and benchmarking tools for ML-based OPF methods.

  7. Dual Conic Proxy for Semidefinite Relaxation of AC Optimal Power Flow

    math.OC 2025-02 conditional novelty 6.0 of 10

    A self-supervised neural network with a dual-completion layer produces valid, fast lower bounds for the SDP relaxation of AC optimal power flow, outperforming SOC-based proxies on some benchmarks.

  8. MxGPS: Multiplex Graph Transformers for a Power Grid Foundation Model

    cs.LG 2026-07 conditional novelty 5.0 of 10

    MxGPS jointly trains state-estimation and power-flow branches over a shared encoder and reports more stable zero-shot behavior on unseen grids, at the price of higher in-distribution error.

  9. A Principled Framework to Evaluate Quality of AC-OPF Datasets for Machine Learning: Benchmarking a Novel, Scalable Generation Method

    eess.SY 2025-08 conditional novelty 5.0 of 10

    Sampling the total active power load instead of individual loads produces more diverse AC-OPF datasets, and a slack-variable formulation lets the generator scale to 4,661-bus grids.

  10. Dispatch-Aware Deep Neural Network for Optimal Transmission Switching: Toward Real-Time and Feasibility Guaranteed Operation

    eess.SY 2025-07 reject novelty 5.0 of 10

    The paper proposes a dispatch-aware neural network that learns transmission switching decisions by minimizing the generation cost of a differentiable DC-OPF layer, yielding fast heuristic solutions to DC-OTS.

  11. Exploring the potential of ChatGPT for feedback and evaluation in experimental physics

    physics.ed-ph 2026-03 unverdicted novelty 3.0 of 10

    ChatGPT is more reliable for formal structure of experimental-physics lab reports than for technical accuracy or interpretation of experimental data, so instructor oversight remains necessary.

  12. Scalable Global Optimization for AC-OPF via Quadratic Convex Relaxation and Branch-and-Bound

    math.OC 2025-05 reject novelty 3.0 of 10

    A fixed-depth branch-and-bound algorithm using QC relaxation lower bounds narrows the optimality gap on small PGLib cases, without proof of global optimality.

Pith tools