Value of problem (2), proof of Lemma 2, p. 6
ProvedSPHardness.FixedRecourse.secondStage_valuefixed-recourseknapsack-polytopep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1reductionstochastic-programming
Let , and . The optimal value of the second-stage linear program (2) is
This pointwise identity connects the linear program to the hinge function used in Lemma 2 and Proposition 1.
Formalization Note The claim is about the value. The page's assertion of unique optimal decisions fails at ties and zero coordinates.
Preamble
import Mathlib import Definitions.Def_SPHardness_FixedRecourse_Model noncomputable section open MeasureTheory open scoped BigOperators
Formal statement
namespace SPHardness.FixedRecourse
theorem secondStage_value {k : ℕ} (α : Fin k → ℝ) (β : ℝ)
(hα : ∀ j, 0 ≤ α j) (ξ : Fin k → ℝ) (hξ : ξ ∈ cube k) :
secondStageValue α β ξ = max ((∑ j, α j * ξ j) - β) 0 := by sorry
end SPHardness.FixedRecourse
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. 6, proof of Lemma 2; also p. 3, proof of Proposition 1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.