§4.3, p. 25, paragraph after the proof of Theorem 3 — z*(ξ̄)′ξ̄ > 0 implies z′ξ̄ ≥ z*(ξ̄)′ξ̄ > 0 for all z ∈ 𝒵
ProvedPDScenRed.Mean.pos_on_Zp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1scenario-reduction
Let and let be a selection of minimizers, for every . If satisfies , then every feasible decision has positive cost under :
The paper applies this with and Assumption 5b: every decision, in particular every , has , so the second clipping in is inactive.
Preamble
import Mathlib import Definitions.Def_PDScenRed_Mean_Setting open scoped InnerProductSpace open MeasureTheory
Formal statement
namespace PDScenRed.Mean
theorem pos_on_Z {d r : ℕ} (P : Matrix (Fin r) (Fin d) ℝ) (qv : Fin r → ℝ)
(zsel : EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d))
(hsel : ∀ ξ, zsel ξ ∈ SmartPTO.Fisher.Wstar (polytope P qv) ξ)
(v : EuclideanSpace ℝ (Fin d)) (hv : 0 < ⟪zsel v, v⟫_ℝ) :
∀ z ∈ polytope P qv, ⟪zsel v, v⟫_ℝ ≤ ⟪z, v⟫_ℝ ∧ 0 < ⟪z, v⟫_ℝ := by sorry
end PDScenRed.Mean
Source
Bertsimas & Mundru, Optimization-based Scenario Reduction for Data-Driven Two-stage Stochastic Optimization, author manuscript (MIT DSpace), p. 25, §4.3, paragraph after the proof of Theorem 3, second sentence
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.