Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 4 — weak duality for every prefix

Proved
WagelmansELS.DualGreedy.weak_duality

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

linear-optimizationlot-sizingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let uuu be any feasible vector for Program D′, and let F(j)F(j)F(j) be the forward lot-sizing cost. For every prefix 1≤j≤n1\le j\le n1≤j≤n,

∑t=1jdtut≤F(j).\sum_{t=1}^{j}d_tu_t\le F(j).t=1∑j​dt​ut​≤F(j).

The paper invokes duality and the structure of D′ for this upper bound. This formulation makes the prefix and the feasible class explicit, including zero-demand periods.

Preamble
import Mathlib
import Definitions.Def_WagelmansELS_DualGreedy_Model
Formal statement
namespace WagelmansELS.DualGreedy

theorem weak_duality (P : Instance) (u : ℕ → ℝ)
    (hd : ∀ t, 1 ≤ t → t ≤ P.n → 0 ≤ P.d t)
    (hf : ∀ i, 1 ≤ i → i ≤ P.n → 0 ≤ P.f i)
    (hu : IsFeasible P u)
    (j : ℕ) (hj1 : 1 ≤ j) (hjn : j ≤ P.n) :
    objective P u j ≤ F P j := by sorry

end WagelmansELS.DualGreedy
Source
Wagelmans, Van Hoesel and Kolen, Economic Lot Sizing, Oper. Res. 40 Supp. 1 (1992), p. S153, Section 4, “by duality and the structure of (D′), Σ d_t v_t ≤ F(j) must hold”
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me