p.98 — the sets are convex polyhedral
ProvedKallMayerSLP.ProbConstr.realizationSet_convex_polyhedralchance-constraintsp2o-gran-per-chapterp2o-plan-bookp2o-strengthenedp2o-v1probability-constraintsstochastic-programming
For every realization the set
is convex, and it is polyhedral: there are vectors and numbers with . In particular the sets of a finite discrete distribution are convex polyhedral sets.
By (2.18), is a finite union of intersections of these sets.
Differences from the source:
- generalization: the sets K_j for the atoms ξ̂^j, with affine data → the set for every realization ξ and arbitrary data T, h; reason: K_j is the case ξ = ξ̂^j, and affine data are a special case
- reading: "convex polyhedral sets" → convex, and equal to {x | ∀ k, b_k ≤ a_k ⬝ x} for some a : Fin m → ℝ^n, b : Fin m → ℝ; reason: a polyhedral set is the solution set of finitely many linear inequalities
Preamble
import Mathlib import Definitions.Def_KallMayerSLP_ProbConstr_realizationSet open Matrix
Formal statement
namespace KallMayerSLP.ProbConstr
/-- The sets `K_j = {x | T(ξ̂^j)x ≥ h(ξ̂^j)}` "are clearly convex polyhedral sets": each is convex
and is the solution set of finitely many linear inequalities `a_k ⬝ x ≥ b_k`.
Kall & Mayer 2005, Chapter 2, §2.2, p.98 (PDF 108), the sentence after the definition of `K_j`.
**Formalization Note.** Stated for every realization `ξ` and arbitrary data `T`, `h`; "polyhedral"
is read as "the intersection of finitely many closed half-spaces `{x | b_k ≤ a_k ⬝ᵥ x}`" (`m`
inequalities, allowing `a_k = 0`). -/
theorem realizationSet_convex_polyhedral {r m n : ℕ} (T : (Fin r → ℝ) → Matrix (Fin m) (Fin n) ℝ)
(h : (Fin r → ℝ) → Fin m → ℝ) (ξ : Fin r → ℝ) :
Convex ℝ (realizationSet T h ξ) ∧
∃ (a : Fin m → Fin n → ℝ) (b : Fin m → ℝ),
realizationSet T h ξ = {x | ∀ k, b k ≤ a k ⬝ᵥ x} := by sorry
end KallMayerSLP.ProbConstr
Source
Kall & Mayer, Stochastic Linear Programming: Models, Theory, and Computation (Kluwer/Springer 2005), Chapter 2, Chapter 2, §2.2, p.98 (PDF 108), definition of K_j and the sentence following it
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.