Closed-form worst-case value-at-risk over marginalized semivariance ambiguity sets
ProvedDRCVRP.Marginal.semivariance_worstCaseVaR_eqdistributionally-robust-optimizationp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1value-at-risk
Let be a marginalized semivariance ambiguity set of the form (10),
where , with , , and . Let . Then for every customer ,
The last two terms come from the upper and the lower semivariance bound respectively. With Theorem 3 this gives the worst-case value-at-risk of every customer set over (10).
Formalization Note Customers are Fin n (0-based); the left side is worstCaseVaR (semivarianceSet qlo qhi μ σplus σminus) ε {i}. The four-term minimum is nested binary min. In the fourth term the root is taken of the product and the division by is outside it, as printed.
Preamble
import Mathlib import Definitions.Def_MultistageStochastic_RiskFunctional import Definitions.Def_DRCVRP_Marginal_WorstCaseVaR import Definitions.Def_DRCVRP_Marginal_AmbiguitySets open MeasureTheory
Formal statement
namespace DRCVRP.Marginal
/-- Proposition 4 (Ghosal and Wiesemann 2020, §4.3, p. 725, Eq. (11)): the worst-case
value-at-risk of one customer's demand over the marginalized semivariance ambiguity set (10). -/
theorem semivariance_worstCaseVaR_eq {n : ℕ}
(qlo qhi μ : Fin n → ℝ) (ε : ℝ) (hε₀ : 0 < ε) (hε₁ : ε < 1)
(hqlo : ∀ i, 0 ≤ qlo i) (hμ : ∀ i, qlo i < μ i ∧ μ i < qhi i)
(σplus σminus : Fin n → ℝ) (hσplus : ∀ i, 0 < σplus i) (hσminus : ∀ i, 0 < σminus i)
(i : Fin n) :
worstCaseVaR (semivarianceSet qlo qhi μ σplus σminus) ε {i} =
μ i + min (min (min (qhi i - μ i) ((1 - ε) / ε * (μ i - qlo i)))
(Real.sqrt (σplus i / ε))) (Real.sqrt ((1 - ε) * σminus i) / ε) := by sorry
end DRCVRP.Marginal
Source
Ghosal and Wiesemann, The Distributionally Robust Chance-Constrained Vehicle Routing Problem, Oper. Res. 68(3) (2020) 716–732, §4.3, p. 725, Proposition 4, Eq. (11) (ambiguity set Eq. (10))
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.