Strengthened and Faster Linear Approximation to Joint Chance Constraints with Wasserstein Ambiguity

Hanbin Yang; Thomas Morstyn; Yihong Zhou; Yuxin Xia

arxiv: 2412.12992 · v3 · submitted 2024-12-17 · 🧮 math.OC

Strengthened and Faster Linear Approximation to Joint Chance Constraints with Wasserstein Ambiguity

Yihong Zhou , Yuxin Xia , Hanbin Yang , Thomas Morstyn This is my paper

Pith reviewed 2026-05-23 06:51 UTC · model grok-4.3

classification 🧮 math.OC

keywords Wasserstein distributionally robust optimizationjoint chance constraintslinear approximationright-hand-side uncertaintyunit commitmentrobustness maximizationcomputational speedup

0 comments

The pith

A strengthened linear inner approximation for right-hand-side Wasserstein joint chance constraints preserves feasibility guarantees while cutting computation time.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper develops the Strengthened and Faster Linear Approximation (SFLA) as a convex inner-approximation for Wasserstein distributionally robust joint chance constraints with right-hand-side uncertainties. The strengthening reduces the number of constraints and tightens the region for ancillary variables, which the authors prove maintains the original robustness level without extra conservativeness and can improve upon common methods such as W-CVaR. The approach is extended to a robustness-maximization formulation that selects risk level and Wasserstein radius to maximize solution robustness subject to a utility degradation limit. These changes matter because exact reformulations become intractable for large problems like power system unit commitment, while the new method delivers substantial speed gains in both convex and non-convex settings.

Core claim

The proposed SFLA strengthens an existing convex inner-approximation for RHS-WDRJCC by reducing the number of constraints and tightening the feasible region for ancillary variables. This process yields significant computational speedup without introducing extra conservativeness and can be less conservative than approximations such as W-CVaR. The SFLA extends to robustness maximization, where the risk level and Wasserstein radius are chosen by maximizing solution robustness subject to a utility degradation limit, and the radius-maximization form is shown to hold advantages over risk-minimization forms.

What carries the argument

The Strengthened and Faster Linear Approximation (SFLA), obtained by strengthening an existing convex inner-approximation of RHS-WDRJCC through constraint reduction and ancillary-variable tightening.

If this is right

SFLA achieves up to 10x computational speedup in power system unit commitment compared to the strengthened and exact reformulation.
In bilevel strategic bidding problems where exact reformulation is unavailable due to non-convexity, SFLA produces 90x speedup relative to W-CVaR.
In robustness maximization settings, SFLA yields over 100x speedup.
SFLA does not introduce extra conservativeness and can be less conservative than W-CVaR.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same strengthening technique could be tested on left-hand-side uncertainty versions of WDRJCC if an analogous base approximation exists.
Radius-maximization formulations may simplify tuning when decision makers find it easier to specify a utility degradation limit than a target risk level.
Embedding SFLA inside decomposition algorithms for multilevel problems could further reduce solve times beyond the reported speedups.

Load-bearing premise

The validity of the original convex inner-approximation under Wasserstein ambiguity carries over to the strengthened version without additional restrictions on the uncertainty distributions.

What would settle it

A concrete numerical example in which an optimal solution produced by SFLA violates the joint chance constraint for some distribution inside the Wasserstein ball, or in which SFLA returns a strictly smaller feasible set than the unstrengthened inner approximation.

read the original abstract

Many real-world decision-making problems have uncertain parameters in constraints. Wasserstein distributionally robust joint chance constraints (WDRJCC) offer a promising solution by explicitly guaranteeing the probability of the simultaneous constraint satisfaction. However, WDRJCC are computationally demanding, and practical applications often require more tractable approaches, especially for large-scale problems such as power system unit commitment problems and multilevel problems with chance constraints in lower levels. To address this, this paper proposes a convex inner-approximation for WDRJCC with right-hand-side uncertainties (RHS-WDRJCC). We propose a Strengthened and Faster Linear Approximation (SFLA) by strengthening an existing convex inner-approximation. This strengthening process reduces the number of constraints and tightens the feasible region for ancillary variables, leading to significant computational speedup. We prove that the proposed SFLA does not introduce extra conservativeness and can be less conservative compared to common approximations such as W-CVaR. We then extend the proposed SFLA to a more interpretable decision-making paradigm: robustness maximization, where the risk level and the Wasserstein radius are determined by maximizing solution robustness subject to a utility degradation limit. We discuss the connection between risk minimization and radius maximization as two formulations of robustness maximization, and show the advantage of radius maximization. In power system unit commitment, the proposed SFLA achieves up to 10x computational speedup compared to the strengthened and exact reformulation. In a bilevel strategic bidding problem where the exact reformulation is not applicable due to non-convexity, the proposed SFLA leads to 90x speedup than W-CVaR. In robustness maximization, the proposed SFLA demonstrated over 100x speedup.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

SFLA strengthens an existing linear inner approx for RHS-WDRJCC, cuts constraints for speed, and claims no added conservativeness with proofs; the main value is the reported speedups in unit commitment and bilevel cases.

read the letter

The paper takes an existing convex inner approximation for Wasserstein distributionally robust joint chance constraints with right-hand-side uncertainty and strengthens it by reducing the number of constraints and tightening bounds on ancillary variables. This produces the SFLA, which the authors prove preserves the original conservativeness level and can beat W-CVaR in some settings. They also extend it to a robustness-maximization formulation that chooses risk level and Wasserstein radius to maximize robustness subject to a utility limit, and they compare the risk-min and radius-max versions. The empirical section shows up to 10x speedup versus the strengthened exact reformulation on unit commitment, 90x versus W-CVaR on a bilevel bidding problem where exact reformulation fails due to non-convexity, and over 100x on the robustness-max version. Those numbers are the clearest practical takeaway. The proofs for no extra conservativeness are the key technical claim, and the paper states they are independent of the base approximation. The stress-test concern about whether tightening ancillary constraints could break validity inside the Wasserstein ball is reasonable to raise, but the authors supply explicit proofs for the RHS case, so the carry-over appears to be addressed rather than merely assumed. The work is incremental rather than a new framework, yet the constraint reduction and the robustness-max extension are concrete additions that were not in the cited prior literature. It is aimed at people who already use Wasserstein DRO chance constraints in power systems or multilevel optimization and need something that scales to larger instances. A reader working on those applications will find the speedups and the robustness-max discussion directly usable. The math and experiments look solid enough to warrant referee time; the proofs and the numerical comparisons are the parts that need the closest check, but nothing here looks like a load-bearing gap.

Referee Report

2 major / 2 minor

Summary. The paper proposes a Strengthened and Faster Linear Approximation (SFLA) for Wasserstein distributionally robust joint chance constraints with right-hand-side uncertainties (RHS-WDRJCC). It strengthens an existing convex inner-approximation by reducing the number of constraints and tightening ancillary-variable feasible regions, claims to prove that this introduces no extra conservativeness (and can be less conservative than W-CVaR), extends the approach to a robustness-maximization formulation, and reports computational speedups of up to 10x (unit commitment), 90x (bilevel bidding), and 100x (robustness maximization) relative to exact reformulations or W-CVaR.

Significance. If the no-extra-conservativeness claim holds, the work supplies a tractable convex inner approximation for RHS-WDRJCC that preserves validity while delivering substantial speedups in large-scale applications such as power-system unit commitment. The extension to radius-maximization robustness formulations and the explicit comparison with W-CVaR are useful for practitioners facing non-convex lower-level problems where exact reformulations are unavailable.

major comments (2)

[Section 3 (proof of no extra conservativeness)] The central claim that SFLA introduces no extra conservativeness (and can be less conservative than W-CVaR) rests on the base convex inner-approximation remaining a valid inner set for every distribution inside the Wasserstein ball after the ancillary-variable tightening. No explicit condition is derived or cited ensuring that the Wasserstein metric does not interact with the added cuts; if the base validity proof relies on properties altered by the strengthening, the result fails for some radii or support sizes. This is load-bearing for the main theoretical contribution.
[Section 2.2 and Theorem 1] The extension of the base approximation's validity to the strengthened version under the Wasserstein ambiguity set is stated without additional restrictions on the uncertainty distributions. The manuscript develops the method specifically for RHS-WDRJCC but does not provide a separate verification that the Wasserstein ball properties survive the tightening of ancillary constraints.

minor comments (2)

[Section 3] Notation for the ancillary variables and the tightened feasible region could be clarified with an explicit comparison table showing the original versus strengthened constraint sets.
[Section 5] The numerical tables report speedups but do not include the number of scenarios or support points used in the Wasserstein ambiguity set; adding these would aid reproducibility.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the detailed and constructive report. The concerns focus on the explicitness of the validity proof for the strengthened approximation under the Wasserstein ball. We address each point below and will revise the manuscript to improve clarity without altering the core claims.

read point-by-point responses

Referee: [Section 3 (proof of no extra conservativeness)] The central claim that SFLA introduces no extra conservativeness (and can be less conservative than W-CVaR) rests on the base convex inner-approximation remaining a valid inner set for every distribution inside the Wasserstein ball after the ancillary-variable tightening. No explicit condition is derived or cited ensuring that the Wasserstein metric does not interact with the added cuts; if the base validity proof relies on properties altered by the strengthening, the result fails for some radii or support sizes. This is load-bearing for the main theoretical contribution.

Authors: The proof in Section 3 first recalls the validity of the base inner approximation for any distribution in the Wasserstein ball (using the standard worst-case distribution characterization for RHS uncertainty), then shows that the strengthening consists of (i) removing redundant constraints that are implied by the original formulation and (ii) tightening ancillary-variable bounds via inequalities that hold uniformly over the entire ball. These operations preserve the projected feasible set for the decision variables and do not alter the support or radius conditions used in the base proof. Consequently, the Wasserstein metric properties remain unchanged. We will add an explicit remark (or short lemma) in the revised Section 3 stating that the added cuts are valid for all radii and support sizes because they derive directly from the same moment-matching and support constraints employed in the original validity argument. revision: yes
Referee: [Section 2.2 and Theorem 1] The extension of the base approximation's validity to the strengthened version under the Wasserstein ambiguity set is stated without additional restrictions on the uncertainty distributions. The manuscript develops the method specifically for RHS-WDRJCC but does not provide a separate verification that the Wasserstein ball properties survive the tightening of ancillary constraints.

Authors: Theorem 1 and the surrounding discussion in Section 2.2 extend the base result by noting that the strengthening is a conservative-preserving reformulation that maintains the inner-approximation property for RHS-WDRJCC. No extra restrictions on distributions are needed because the ancillary tightening uses bounds that are independent of the specific distribution inside the ball. To make the argument fully self-contained, we will insert a short verification paragraph immediately after Theorem 1 that confirms the Wasserstein-ball worst-case characterization is unaffected by the ancillary tightening, again referencing the uniform validity of the cuts. revision: yes

Circularity Check

0 steps flagged

No circularity: SFLA properties established by independent proof on strengthened inner approximation

full rationale

The paper constructs SFLA by strengthening a prior convex inner-approximation for RHS-WDRJCC and claims an explicit proof that the strengthening introduces no extra conservativeness while preserving validity inside the Wasserstein ball. No equation or step reduces a claimed result to a fitted parameter, self-defined quantity, or load-bearing self-citation chain; the speedup and conservativeness claims rest on the algebraic tightening of ancillary-variable constraints and the stated proof, which the text presents as self-contained rather than imported by construction. The derivation therefore remains independent of its own outputs.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on the domain assumption of right-hand-side uncertainties and standard mathematical properties of Wasserstein metrics and chance constraints.

axioms (2)

domain assumption The uncertainty is only on the right-hand side of the constraints.
The method is specified for RHS-WDRJCC.
standard math Standard properties of Wasserstein distance and convex optimization hold.
Used in deriving the approximation and proving its properties.

pith-pipeline@v0.9.0 · 5854 in / 1274 out tokens · 42023 ms · 2026-05-23T06:51:10.373262+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

We propose a Strengthened and Faster Linear Approximation (SFLA) by strengthening an existing convex inner-approximation... We prove that the proposed SFLA does not introduce extra conservativeness

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

39 extracted references · 39 canonical work pages

[1]

, " * write output.state after.block = add.period write newline

ENTRY address author booktitle chapter doi edition editor eid howpublished institution isbn issn journal key month note number organization pages publisher school series title type url volume year label extra.label sort.label short.list INTEGERS output.state before.all mid.sentence after.sentence after.block FUNCTION init.state.consts #0 'before.all := #1...

work page
[2]

write newline

" write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in "" FUNCTION format.date year ...

work page
[3]

Mathematical Programming 170(1):327--356

Arp \'o n S, Homem-de Mello T, Pagnoncelli B (2018) Scenario reduction for stochastic programs with conditional value-at-risk. Mathematical Programming 170(1):327--356

work page 2018
[4]

European Journal of Operational Research 311(2):401--426

Beck Y, Ljubi \'c I, Schmidt M (2023) A survey on bilevel optimization under uncertainty. European Journal of Operational Research 311(2):401--426

work page 2023
[5]

Operations research 55(6):1058--1071

Chen X, Sim M, Sun P (2007) A robust optimization perspective on stochastic programming. Operations research 55(6):1058--1071

work page 2007
[6]

IEEE Transactions on Power Systems 31(6):4732--4743

Chen Y, Casto A, Wang F, Wang Q, Wang X, Wan J (2016) Improving large scale day-ahead security constrained unit commitment performance. IEEE Transactions on Power Systems 31(6):4732--4743

work page 2016
[7]

Operations Research

Chen Z, Kuhn D, Wiesemann W (2022) Data-driven chance constrained programs over wasserstein balls. Operations Research

work page 2022
[8]

Operations Research Letters 51(3):226--233

Chen Z, Kuhn D, Wiesemann W (2023) On approximations of data-driven chance constrained programs over wasserstein balls. Operations Research Letters 51(3):226--233

work page 2023
[9]

Operations research 58(3):595--612

Delage E, Ye Y (2010) Distributionally robust optimization under moment uncertainty with application to data-driven problems. Operations research 58(3):595--612

work page 2010
[10]

Energy 242:123026, ISSN 0360-5442

Dimitriadis CN, Tsimopoulos EG, Georgiadis MC (2022) Strategic bidding of an energy storage agent in a joint energy and reserve market under stochastic generation. Energy 242:123026, ISSN 0360-5442

work page 2022
[11]

IEEE Trans

Ding Y, Morstyn T, McCulloch MD (2022) Distributionally robust joint chance-constrained optimization for networked microgrids considering contingencies and renewable uncertainty. IEEE Trans. on Smart Grid 13(3):2467--2478

work page 2022
[12]

European journal of operational research 235(3):471--483

Gabrel V, Murat C, Thiele A (2014) Recent advances in robust optimization: An overview. European journal of operational research 235(3):471--483

work page 2014
[13]

Mathematics of Operations Research 48(2):603--655

Gao R, Kleywegt A (2023) Distributionally robust stochastic optimization with wasserstein distance. Mathematics of Operations Research 48(2):603--655

work page 2023
[14]

Annual reviews in control 47

Geng X, Xie L (2019) Data-driven decision making in power systems with probabilistic guarantees: Theory and applications of chance-constrained optimization. Annual reviews in control 47

work page 2019
[15]

://www.gurobi.com

Gurobi Optimization, LLC (2024) Gurobi Optimizer Reference Manual . ://www.gurobi.com

work page 2024
[16]

Journal of Global Optimization 84(3):651--685

Heitsch H, Henrion R, Kleinert T, Schmidt M (2022) On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints. Journal of Global Optimization 84(3):651--685

work page 2022
[17]

Mathematical Programming

Ho-Nguyen N, K l n c -Karzan F, K \"u c \"u kyavuz S, Lee D (2021) Distributionally robust chance-constrained programs with right-hand side uncertainty under wasserstein ambiguity. Mathematical Programming

work page 2021
[18]

https://kaggle.com/competitions/GEF2012-wind-forecasting, accessed: 2024-10-11

Hong T, Glider, Pinson P (2012) Global Energy Forecasting Competition 2012 - Wind Forecasting . https://kaggle.com/competitions/GEF2012-wind-forecasting, accessed: 2024-10-11

work page 2012
[19]

Hong T, Pinson P, Fan S (2014) Global energy forecasting competition 2012

work page 2014
[20]

https://icseg.iti.illinois.edu/ieee-24-bus-system/, accessed: 2024-10-11

Illinois Center for a Smarter Electric Grid (ICSEG) (1979) IEEE 24-bus system. https://icseg.iti.illinois.edu/ieee-24-bus-system/, accessed: 2024-10-11

work page 1979
[21]

Operations Research 70(6):3581--3600

Jiang N, Xie W (2022) ALSO-X and ALSO-X +: Better convex approximations for chance constrained programs. Operations Research 70(6):3581--3600

work page 2022
[22]

Mathematical Programming 1--64

Jiang N, Xie W (2024 a ) ALSO-X \#: Better convex approximations for distributionally robust chance constrained programs. Mathematical Programming 1--64

work page 2024
[23]

INFORMS Journal on Computing

Jiang N, Xie W (2024 b ) The terminator: An integration of inner and outer approximations for solving wasserstein distributionally robust chance constrained programs via variable fixing. INFORMS Journal on Computing

work page 2024
[24]

Mathematical Programming 171(1):115--166

Mohajerin Esfahani P, Kuhn D (2018) Data-driven distributionally robust optimization using the wasserstein metric: Performance guarantees and tractable reformulations. Mathematical Programming 171(1):115--166

work page 2018
[25]

IEEE Transactions on Sustainable Energy 9(2):582--598

Nasrolahpour E, Kazempour J, Zareipour H, Rosehart WD (2018) A bilevel model for participation of a storage system in energy and reserve markets. IEEE Transactions on Sustainable Energy 9(2):582--598

work page 2018
[26]

Operations Research Letters 49(3):291--299

Ordoudis C, Nguyen VA, Kuhn D, Pinson P (2021) Energy and reserve dispatch with distributionally robust joint chance constraints. Operations Research Letters 49(3):291--299

work page 2021
[27]

IEEE Transactions on Power Systems 39(2):3949--3961

Paredes \'A , Aguado JA, Essayeh C, Xia Y, Savelli I, Morstyn T (2023) Stacking revenues from flexible ders in multi-scale markets using tri-level optimization. IEEE Transactions on Power Systems 39(2):3949--3961

work page 2023
[28]

Pr \'e kopa A (2013) Stochastic programming, volume 324 (Springer Science & Business Media)

work page 2013
[29]

Scarf HE, Arrow K, Karlin S (1957) A min-max solution of an inventory problem (Rand Corporation Santa Monica)

work page 1957
[30]

IEEE Transactions on Power Systems 33(5):5297--5308

Sun X, Luh PB, Bragin MA, Chen Y, Wan J, Wang F (2018) A novel decomposition and coordination approach for large day-ahead unit commitment with combined cycle units. IEEE Transactions on Power Systems 33(5):5297--5308

work page 2018
[31]

Applied Energy 260:114251, ISSN 0306-2619

Tómasson E, Hesamzadeh MR, Wolak FA (2020) Optimal offer-bid strategy of an energy storage portfolio: A linear quasi-relaxation approach. Applied Energy 260:114251, ISSN 0306-2619

work page 2020
[32]

IEEE Transactions on Power Systems 33(6):6487--6500

van Ackooij W, Finardi EC, Ramalho GM (2018) An exact solution method for the hydrothermal unit commitment under wind power uncertainty with joint probability constraints. IEEE Transactions on Power Systems 33(6):6487--6500

work page 2018
[33]

IEEE Transactions on Sustainable Energy 8(3):1106--1117

Wang Y, Dvorkin Y, Fernández-Blanco R, Xu B, Qiu T, Kirschen DS (2017) Look-ahead bidding strategy for energy storage. IEEE Transactions on Sustainable Energy 8(3):1106--1117

work page 2017
[34]

IEEE Transactions on Sustainable Energy 8(2):530--541

Wang Y, Zhao S, Zhou Z, Botterud A, Xu Y, Chen R (2016) Risk adjustable day-ahead unit commitment with wind power based on chance constrained goal programming. IEEE Transactions on Sustainable Energy 8(2):530--541

work page 2016
[35]

IEEE Transactions on Power Systems 31(6):4185--4196

Wu Z, Zeng P, Zhang XP, Zhou Q (2016) A solution to the chance-constrained two-stage stochastic program for unit commitment with wind energy integration. IEEE Transactions on Power Systems 31(6):4185--4196

work page 2016
[36]

Xu T, Birchfield AB, Gegner KM, Shetye KS, Overbye TJ (2017) Application of large-scale synthetic power system models for energy economic studies

work page 2017
[37]

IEEE Transactions on Power Systems 35(4):2769--2782

Yang Y, Wu W, Wang B, Li M (2020) Analytical reformulation for stochastic unit commitment considering wind power uncertainty with gaussian mixture model. IEEE Transactions on Power Systems 35(4):2769--2782

work page 2020
[38]

://arxiv.org/abs/2308.06386

Zhao H, Tanneau M, Hentenryck PV (2024) On the viability of stochastic economic dispatch for real-time energy market clearing. ://arxiv.org/abs/2308.06386

work page arXiv 2024
[39]

Journal of Modern Power Systems and Clean Energy 9(5)

Zhou H, Zhou Y, Hu J, Yang G, Xie D, Xue Y, Nordström L (2021) LSTM -based energy management for electric vehicle charging in commercial-building prosumers. Journal of Modern Power Systems and Clean Energy 9(5)

work page 2021

[1] [1]

, " * write output.state after.block = add.period write newline

ENTRY address author booktitle chapter doi edition editor eid howpublished institution isbn issn journal key month note number organization pages publisher school series title type url volume year label extra.label sort.label short.list INTEGERS output.state before.all mid.sentence after.sentence after.block FUNCTION init.state.consts #0 'before.all := #1...

work page

[2] [2]

write newline

" write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in "" FUNCTION format.date year ...

work page

[3] [3]

Mathematical Programming 170(1):327--356

Arp \'o n S, Homem-de Mello T, Pagnoncelli B (2018) Scenario reduction for stochastic programs with conditional value-at-risk. Mathematical Programming 170(1):327--356

work page 2018

[4] [4]

European Journal of Operational Research 311(2):401--426

Beck Y, Ljubi \'c I, Schmidt M (2023) A survey on bilevel optimization under uncertainty. European Journal of Operational Research 311(2):401--426

work page 2023

[5] [5]

Operations research 55(6):1058--1071

Chen X, Sim M, Sun P (2007) A robust optimization perspective on stochastic programming. Operations research 55(6):1058--1071

work page 2007

[6] [6]

IEEE Transactions on Power Systems 31(6):4732--4743

Chen Y, Casto A, Wang F, Wang Q, Wang X, Wan J (2016) Improving large scale day-ahead security constrained unit commitment performance. IEEE Transactions on Power Systems 31(6):4732--4743

work page 2016

[7] [7]

Operations Research

Chen Z, Kuhn D, Wiesemann W (2022) Data-driven chance constrained programs over wasserstein balls. Operations Research

work page 2022

[8] [8]

Operations Research Letters 51(3):226--233

Chen Z, Kuhn D, Wiesemann W (2023) On approximations of data-driven chance constrained programs over wasserstein balls. Operations Research Letters 51(3):226--233

work page 2023

[9] [9]

Operations research 58(3):595--612

Delage E, Ye Y (2010) Distributionally robust optimization under moment uncertainty with application to data-driven problems. Operations research 58(3):595--612

work page 2010

[10] [10]

Energy 242:123026, ISSN 0360-5442

Dimitriadis CN, Tsimopoulos EG, Georgiadis MC (2022) Strategic bidding of an energy storage agent in a joint energy and reserve market under stochastic generation. Energy 242:123026, ISSN 0360-5442

work page 2022

[11] [11]

IEEE Trans

Ding Y, Morstyn T, McCulloch MD (2022) Distributionally robust joint chance-constrained optimization for networked microgrids considering contingencies and renewable uncertainty. IEEE Trans. on Smart Grid 13(3):2467--2478

work page 2022

[12] [12]

European journal of operational research 235(3):471--483

Gabrel V, Murat C, Thiele A (2014) Recent advances in robust optimization: An overview. European journal of operational research 235(3):471--483

work page 2014

[13] [13]

Mathematics of Operations Research 48(2):603--655

Gao R, Kleywegt A (2023) Distributionally robust stochastic optimization with wasserstein distance. Mathematics of Operations Research 48(2):603--655

work page 2023

[14] [14]

Annual reviews in control 47

Geng X, Xie L (2019) Data-driven decision making in power systems with probabilistic guarantees: Theory and applications of chance-constrained optimization. Annual reviews in control 47

work page 2019

[15] [15]

://www.gurobi.com

Gurobi Optimization, LLC (2024) Gurobi Optimizer Reference Manual . ://www.gurobi.com

work page 2024

[16] [16]

Journal of Global Optimization 84(3):651--685

Heitsch H, Henrion R, Kleinert T, Schmidt M (2022) On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints. Journal of Global Optimization 84(3):651--685

work page 2022

[17] [17]

Mathematical Programming

Ho-Nguyen N, K l n c -Karzan F, K \"u c \"u kyavuz S, Lee D (2021) Distributionally robust chance-constrained programs with right-hand side uncertainty under wasserstein ambiguity. Mathematical Programming

work page 2021

[18] [18]

https://kaggle.com/competitions/GEF2012-wind-forecasting, accessed: 2024-10-11

Hong T, Glider, Pinson P (2012) Global Energy Forecasting Competition 2012 - Wind Forecasting . https://kaggle.com/competitions/GEF2012-wind-forecasting, accessed: 2024-10-11

work page 2012

[19] [19]

Hong T, Pinson P, Fan S (2014) Global energy forecasting competition 2012

work page 2014

[20] [20]

https://icseg.iti.illinois.edu/ieee-24-bus-system/, accessed: 2024-10-11

Illinois Center for a Smarter Electric Grid (ICSEG) (1979) IEEE 24-bus system. https://icseg.iti.illinois.edu/ieee-24-bus-system/, accessed: 2024-10-11

work page 1979

[21] [21]

Operations Research 70(6):3581--3600

Jiang N, Xie W (2022) ALSO-X and ALSO-X +: Better convex approximations for chance constrained programs. Operations Research 70(6):3581--3600

work page 2022

[22] [22]

Mathematical Programming 1--64

Jiang N, Xie W (2024 a ) ALSO-X \#: Better convex approximations for distributionally robust chance constrained programs. Mathematical Programming 1--64

work page 2024

[23] [23]

INFORMS Journal on Computing

Jiang N, Xie W (2024 b ) The terminator: An integration of inner and outer approximations for solving wasserstein distributionally robust chance constrained programs via variable fixing. INFORMS Journal on Computing

work page 2024

[24] [24]

Mathematical Programming 171(1):115--166

Mohajerin Esfahani P, Kuhn D (2018) Data-driven distributionally robust optimization using the wasserstein metric: Performance guarantees and tractable reformulations. Mathematical Programming 171(1):115--166

work page 2018

[25] [25]

IEEE Transactions on Sustainable Energy 9(2):582--598

Nasrolahpour E, Kazempour J, Zareipour H, Rosehart WD (2018) A bilevel model for participation of a storage system in energy and reserve markets. IEEE Transactions on Sustainable Energy 9(2):582--598

work page 2018

[26] [26]

Operations Research Letters 49(3):291--299

Ordoudis C, Nguyen VA, Kuhn D, Pinson P (2021) Energy and reserve dispatch with distributionally robust joint chance constraints. Operations Research Letters 49(3):291--299

work page 2021

[27] [27]

IEEE Transactions on Power Systems 39(2):3949--3961

Paredes \'A , Aguado JA, Essayeh C, Xia Y, Savelli I, Morstyn T (2023) Stacking revenues from flexible ders in multi-scale markets using tri-level optimization. IEEE Transactions on Power Systems 39(2):3949--3961

work page 2023

[28] [28]

Pr \'e kopa A (2013) Stochastic programming, volume 324 (Springer Science & Business Media)

work page 2013

[29] [29]

Scarf HE, Arrow K, Karlin S (1957) A min-max solution of an inventory problem (Rand Corporation Santa Monica)

work page 1957

[30] [30]

IEEE Transactions on Power Systems 33(5):5297--5308

Sun X, Luh PB, Bragin MA, Chen Y, Wan J, Wang F (2018) A novel decomposition and coordination approach for large day-ahead unit commitment with combined cycle units. IEEE Transactions on Power Systems 33(5):5297--5308

work page 2018

[31] [31]

Applied Energy 260:114251, ISSN 0306-2619

Tómasson E, Hesamzadeh MR, Wolak FA (2020) Optimal offer-bid strategy of an energy storage portfolio: A linear quasi-relaxation approach. Applied Energy 260:114251, ISSN 0306-2619

work page 2020

[32] [32]

IEEE Transactions on Power Systems 33(6):6487--6500

van Ackooij W, Finardi EC, Ramalho GM (2018) An exact solution method for the hydrothermal unit commitment under wind power uncertainty with joint probability constraints. IEEE Transactions on Power Systems 33(6):6487--6500

work page 2018

[33] [33]

IEEE Transactions on Sustainable Energy 8(3):1106--1117

Wang Y, Dvorkin Y, Fernández-Blanco R, Xu B, Qiu T, Kirschen DS (2017) Look-ahead bidding strategy for energy storage. IEEE Transactions on Sustainable Energy 8(3):1106--1117

work page 2017

[34] [34]

IEEE Transactions on Sustainable Energy 8(2):530--541

Wang Y, Zhao S, Zhou Z, Botterud A, Xu Y, Chen R (2016) Risk adjustable day-ahead unit commitment with wind power based on chance constrained goal programming. IEEE Transactions on Sustainable Energy 8(2):530--541

work page 2016

[35] [35]

IEEE Transactions on Power Systems 31(6):4185--4196

Wu Z, Zeng P, Zhang XP, Zhou Q (2016) A solution to the chance-constrained two-stage stochastic program for unit commitment with wind energy integration. IEEE Transactions on Power Systems 31(6):4185--4196

work page 2016

[36] [36]

Xu T, Birchfield AB, Gegner KM, Shetye KS, Overbye TJ (2017) Application of large-scale synthetic power system models for energy economic studies

work page 2017

[37] [37]

IEEE Transactions on Power Systems 35(4):2769--2782

Yang Y, Wu W, Wang B, Li M (2020) Analytical reformulation for stochastic unit commitment considering wind power uncertainty with gaussian mixture model. IEEE Transactions on Power Systems 35(4):2769--2782

work page 2020

[38] [38]

://arxiv.org/abs/2308.06386

Zhao H, Tanneau M, Hentenryck PV (2024) On the viability of stochastic economic dispatch for real-time energy market clearing. ://arxiv.org/abs/2308.06386

work page arXiv 2024

[39] [39]

Journal of Modern Power Systems and Clean Energy 9(5)

Zhou H, Zhou Y, Hu J, Yang G, Xie D, Xue Y, Nordström L (2021) LSTM -based energy management for electric vehicle charging in commercial-building prosumers. Journal of Modern Power Systems and Clean Energy 9(5)

work page 2021