Proof of Theorem 3, p. 11 — expected recourse equals one minus order-polytope volume
ProvedSPHardness.OrderPolytope.expRecourse_eqorder-polytopep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1random-recoursestochastic-programmingvolume
For a finite poset , let be the expected optimal value of (10) under the uniform law on , and let be the volume of its order polytope. Then
This converts an approximation of the expected recourse value into an approximation of order-polytope volume with the same absolute error.
Formalization Note The expectation is a Lebesgue integral over the unit cube, whose volume is one.
Preamble
import Mathlib import Definitions.Def_SPHardness_OrderPolytope_Model
Formal statement
namespace SPHardness.OrderPolytope
/-- Expected recourse equals the volume of the complement of the order polytope. -/
theorem expRecourse_eq (P : Type) [Fintype P] [PartialOrder P] :
expRecourse P = 1 - volOrder P := 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, displayed identity. 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.