p. 10, proof of Theorem 2 — weak duality at feasible points
ProvedNonlinSSD.Optimality.weak_dualitylagrangian-dualityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-dominance
For any feasible pair of (11)–(14), utilities , and essentially bounded multipliers almost surely,
This inequality is the comparison used in the sufficiency direction of Theorem 2.
Formalization Note Feasibility includes integrability of every , interval restricted dominance, and almost surely. Essential boundedness and almost sure nonnegativity of make the product terms integrable and nonnegative in expectation.
Preamble
import Mathlib import Definitions.Def_NonlinSSD_Optimality_Basic
Formal statement
namespace NonlinSSD.Optimality
open MeasureTheory
/-- p. 10, proof of Theorem 2 (converse): at a feasible point the Lagrangian
dominates the primal objective for every dual-feasible pair. -/
theorem weak_duality
{Ω 𝒵 : Type*} [MeasurableSpace Ω]
[AddCommGroup 𝒵] [Module ℝ 𝒵] [TopologicalSpace 𝒵]
[IsTopologicalAddGroup 𝒵] [ContinuousSMul ℝ 𝒵]
[LocallyConvexSpace ℝ 𝒵] [T2Space 𝒵]
[TopologicalSpace.SeparableSpace 𝒵]
{P : Measure Ω} [IsProbabilityMeasure P] {m : ℕ}
(pr : Problem Ω 𝒵 P m) (z : 𝒵) (X : Fin m → Ω → ℝ)
(u : Fin m → ℝ → ℝ) (θ : Fin m → Ω → ℝ)
(hfeas : pr.Feasible z X)
(hu : pr.UtilityAdmissible u)
(hθ : pr.MultiplierAdmissible θ) :
(∫ ω, pr.H z ω ∂P) ≤ pr.L z X u θ := by sorry
end NonlinSSD.Optimality
Source
Dentcheva, Ruszczyński, Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints, author manuscript (rev. April 2003; Math. Program. 2004, DOI 10.1007/s10107-003-0453-z), p. 10, proof of Theorem 2 (converse)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.