Proposition 2 — under box uncertainty, worst-case CVaR minimization (16)–(20) is equivalent to the LP (24)–(30)
ProvedWorstCaseCVaR.Box.proposition_2Let be a loss function, the scenarios of the random vector, the decision set, the confidence level, and let the distribution range over the box
Then:
- If solves (24)–(30), then solves (16)–(20) with .
- Conversely, if solves (16)–(20) with , then solves (24)–(30) for every optimal solution of the linear program (23) with ,
- and such an optimal solution of (23) exists.
Here "solves" means: feasible, with objective value minimal among all feasible points. The proposition turns the semi-infinite worst-case CVaR problem (16)–(20) into a single finite problem (24)–(30), a linear program when is linear in and is a polyhedron.
Formalization Note Constraint (18) is in its equivalent "for all " form. Clause 3 makes explicit the existence that the paper's "where is an optimal solution to (23)" presupposes. No hypothesis on , , , , is added: when is empty neither problem has an optimal solution, so the statement holds for all data.
import Mathlib import Definitions.Def_WorstCaseCVaR_Box_Problems open Matrix
namespace WorstCaseCVaR.Box
/-- Proposition 2, p. 1159. (1) If `(x*, u*, z*, ξ*, ω*, α*, θ*)` solves (24)–(30), then
`(x*, u*, α*, θ*)` solves (16)–(20) with `𝒫_π = 𝒫_π^B`. (2) Conversely, if `(x̃*, ũ*, α̃*, θ̃*)`
solves (16)–(20) with `𝒫_π = 𝒫_π^B`, then `(x̃*, ũ*, z̃*, ξ̃*, ω̃*, α̃*, θ̃*)` solves (24)–(30)
for every optimal solution `(z̃*, ξ̃*, ω̃*)` of (23) with `u = ũ*`; (3) such an optimal
solution exists. -/
theorem proposition_2 {n m S : ℕ} (f : (Fin n → ℝ) → (Fin m → ℝ) → ℝ)
(ys : Fin S → Fin m → ℝ) (𝒳 : Set (Fin n → ℝ)) (β : ℝ) (hβ0 : 0 < β) (hβ1 : β < 1)
(π0 ηlo ηhi : Fin S → ℝ) :
(∀ q : Var24 n S, Solves24 f ys 𝒳 β π0 ηlo ηhi q →
Solves16 f ys 𝒳 β π0 ηlo ηhi q.toVar16) ∧
(∀ p : Var16 n S, Solves16 f ys 𝒳 β π0 ηlo ηhi p →
∀ d : Dual23 S, IsOptimal23 ηlo ηhi p.u d →
Solves24 f ys 𝒳 β π0 ηlo ηhi (p.withDual d)) ∧
(∀ p : Var16 n S, Solves16 f ys 𝒳 β π0 ηlo ηhi p →
∃ d : Dual23 S, IsOptimal23 ηlo ηhi p.u d) := by sorry
end WorstCaseCVaR.Box
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.