§2.4, (2.6), p. 7 — has the same optimal value as problem (2.6)
ProvedPrimalDualLDR.FixedRecourse.sec_2_4_eq_2_6linear-decision-rulesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-programming
Assume the standing assumptions of §2. Then the dual linear-decision-rule problem
and problem (2.6),
have the same optimal value (in , with for an infeasible problem).
This is the first step of the tractable reformulation of the dual approximation: the infinite-dimensional decision rules are replaced by the finite-dimensional matrices determined by them through (2.5), and only a moment-feasibility condition on remains.
Preamble
import Mathlib import Definitions.Def_PrimalDualLDR_FixedRecourse_Basic import Definitions.Def_PrimalDualLDR_FixedRecourse_Setting import Definitions.Def_PrimalDualLDR_FixedRecourse_Problems open MeasureTheory Matrix
Formal statement
namespace PrimalDualLDR.FixedRecourse /-- §2.4, (2.6), p. 7 (unnumbered): under the standing assumptions of §2, the dual linear-decision-rule problem `SP^l` is equivalent to problem (2.6): their optimal values coincide. -/ theorem sec_2_4_eq_2_6 (σ : Setting) (hσ : σ.Standing) : σ.valSPl = σ.valLP26 := by sorry end PrimalDualLDR.FixedRecourse
Source
Kuhn, Wiesemann, Georghiou, Primal and dual linear decision rules in stochastic and robust optimization, Optimization Online 2009/02/2218, §2.4, p. 7, (2.5)–(2.6) (unnumbered claim)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.