Theorem 3, primal part — is equivalent to the linear program (4.2)
ProvedPrimalDualLDR.Multistage.theorem_3_primalConsider the linear multistage stochastic program of §4 with deterministic constraint matrices , right-hand sides and costs , and assume that has a polyhedral support of the type (2.1) (nonempty, bounded, spanning , with of the form (2.1b) and ). Fix matrices .
The primal linear-decision-rule problem
has the same optimal value as the linear program
Optimal values are infima in the extended reals ( if infeasible, if unbounded). This is the first assertion of Theorem 3; it needs only the support assumptions (the conditional-mean and strict-feasibility hypotheses of Theorem 3 are not used, so they are omitted, which makes the statement slightly stronger). The proof is the robust-counterpart argument of §2: an almost surely nonnegative linear function is nonnegative on the support , and by the affine Farkas lemma this is equivalent to the existence of the multipliers .
import Mathlib import Definitions.Def_PrimalDualLDR_Multistage_Basic import Definitions.Def_PrimalDualLDR_Multistage_Setting import Definitions.Def_PrimalDualLDR_Multistage_Problems open MeasureTheory Matrix
namespace PrimalDualLDR.Multistage
/-- Theorem 3 (p. 22), first assertion: if `P` has a polyhedral support of the type (2.1) (the
standing assumptions of §4), then the primal linear-decision-rule problem `𝓜𝒮𝒫^u` and the linear
program (4.2) have the same optimal value. Only the standing assumptions are needed for this half;
the linear-conditional-mean and strict-feasibility hypotheses of Theorem 3 are not used. -/
theorem theorem_3_primal (σ : Setting) (hσ : σ.Standing) :
σ.valMSPu = σ.valLP42 := by sorry
end PrimalDualLDR.Multistage