(18), Sect. 5.1.2, p. 15 — moment conditions Σ_{k≤min{m,d}} C(m,k) ∫_[0,1] (1−v)^(m−k) dF_k(v) = 1
ProvedWaitJudge.Convex.moment_conditionsmoment-problemp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1scenario-optimization
Consider a convex scenario problem: , every and the tie-break functions are convex, is a probability measure, and Assumptions 1 and 2 and the measurability conditions hold. Then the generalized distribution functions of (12) satisfy, for every ,
These infinitely many moment equations are necessary conditions on the -tuples that can arise from a convex scenario problem. They are the constraints of the generalized moment problem (19) whose value bounds .
Formalization Note is a finite measure on and the integral is over the closed interval . The identity is stated for every , with no relation between and assumed.
Preamble
import Mathlib import Definitions.Def_ScenarioApproach_Generalization_violation import Definitions.Def_WaitJudge_Convex_Setting open MeasureTheory ScenarioApproach.Generalization
Formal statement
namespace WaitJudge.Convex
theorem moment_conditions {d p : ℕ} {Δ : Type*} [MeasurableSpace Δ] (P : Measure Δ) [IsProbabilityMeasure P]
(c : E d) (X : Set (E d)) (Xδ : Δ → Set (E d)) (tb : Fin p → E d → ℝ)
(hX : Convex ℝ X) (hXδ : ∀ δ, Convex ℝ (Xδ δ))
(htb : ∀ j, ConvexOn ℝ Set.univ (tb j))
(hA1 : Assumption1 c X Xδ tb) (hA2 : Assumption2 c X Xδ tb P)
(hmeas : MeasurabilityPins c X Xδ tb) :
∀ m : ℕ, ∑ k ∈ Finset.range (min m d + 1),
(m.choose k : ℝ) * ∫ v in Set.Icc 0 1, (1 - v) ^ (m - k) ∂(Fk P c X Xδ tb k) = 1 := by sorry
end WaitJudge.Convex
Source
Campi & Garatti, Wait-and-judge scenario optimization, Math. Program. (2018), doi:10.1007/s10107-016-1056-9 (accepted manuscript), PDF p. 15, Sect. 5.1.2, (18)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.