Pith. sign in

REVIEW 1 cited by

Data-driven Decision Making with Probabilistic Guarantees (Part 1): A Schematic Overview of Chance-constrained Optimization

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 1903.10621 v2 pith:AYABT3BC submitted 2019-03-25 math.OC

classification math.OC
keywords methodsoptimizationchance-constrainedpartprovidescriticaldata-drivendecision
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Uncertainties from deepening penetration of renewable energy resources have posed critical challenges to the secure and reliable operations of future electric grids. Among various approaches for decision making in uncertain environments, this paper focuses on chance-constrained optimization, which provides explicit probabilistic guarantees on the feasibility of optimal solutions. Although quite a few methods have been proposed to solve chance-constrained optimization problems, there is a lack of comprehensive review and comparative analysis of the proposed methods. Part I of this two-part paper reviews three categories of existing methods to chance-constrained optimization: (1) scenario approach; (2) sample average approximation; and (3) robust optimization based methods. Data-driven methods, which are not constrained by any particular distributions of the underlying uncertainties, are of particular interest. Part II of this two-part paper provides a literature review on the applications of chance-constrained optimization in power systems. Part II also provides a critical comparison of existing methods based on numerical simulations, which are conducted on standard power system test cases.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learning to Optimize Joint Chance-constrained Power Dispatch Problems

    eess.SY 2025-01 reject novelty 5.0 of 10

    A machine learning proxy with a set aggregator and a feasible-projection module predicts solutions to a joint chance-constrained VPP dispatch problem in about 3 milliseconds, but at a roughly 10% higher objective cost...

Pith tools