Proof of Theorem 3, p. 11 — pointwise value of problem (10)
ProvedSPHardness.OrderPolytope.secondStage_valueorder-polytopep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1random-recoursestochastic-programming
Let be a finite poset, its unit cube, and its order polytope. For every realization , the optimal value of the second-stage program (10) is
This identifies the recourse value with the indicator of the cube outside the order polytope and supplies the pointwise step in Theorem 3.
Formalization Note The claim is restricted to the cube, which is the support of the paper's uniform law.
Preamble
import Mathlib import Definitions.Def_SPHardness_OrderPolytope_Model
Formal statement
namespace SPHardness.OrderPolytope
open Classical
/-- The value of (10) on the unit cube, as used in the proof of Theorem 3. -/
theorem secondStage_value (P : Type) [Fintype P] [PartialOrder P]
(ξ : P → ℝ) (hξ : ξ ∈ cube P) :
secondStageValue P ξ = if ξ ∈ orderPolytope P then 0 else 1 := by sorry
end SPHardness.OrderPolytope
Source
Hanasusanto, Kuhn & Wiesemann, A comment on "computational complexity of stochastic programming problems", Optimization Online preprint 2015/03/4825 (version of October 6, 2015), p. 11, proof of Theorem 3, first sentence. https://optimization-online.org/wp-content/uploads/2015/03/4825.pdf
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.