Proposition 4 — the optimal recourse cost q(s, x₁) is measurable in s
ProvedStochConvexProg.FirstStage.proposition_4measurabilityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1recoursestochastic-programming
For each , the optimal recourse cost
is a measurable function of .
This is the measurability needed for the integral in the definition of the intrinsic first-stage objective to be meaningful.
Preamble
import Mathlib import Definitions.Def_StochConvexProg_FirstStage_Problem import Definitions.Def_DupacovaWets_Consistency_expect import Definitions.Def_StochConvexProg_FirstStage_FirstStage open MeasureTheory
Formal statement
namespace StochConvexProg.FirstStage
/-- Proposition 4, p. 185: for each `x₁ ∈ Rⁿ¹`, `q(s, x₁)` is measurable in `s ∈ S`. -/
theorem proposition_4 {S : Type*} [MeasurableSpace S] {σ : Measure S} [IsProbabilityMeasure σ]
{n₁ n₂ m₁ m₂ : ℕ} (pr : Problem S σ n₁ n₂ m₁ m₂) :
∀ x₁ : Fin n₁ → ℝ, Measurable (fun s => pr.q s x₁) := by sorry
end StochConvexProg.FirstStage
Source
Rockafellar and Wets, Stochastic convex programming: basic duality, Pacific J. Math. 62(1) (1976), p. 185, Proposition 4
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.