Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 4 — greedy forward values satisfy D′

Proved
WagelmansELS.DualGreedy.greedy_forward_feasible

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

greedy-algorithmlot-sizingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let demands and setup costs be nonnegative and marginal costs unrestricted. Every vector vvv satisfying the greedy forward rule obeys all constraints of Program D′:

∑t=indtmax⁡{0,vt−ci}≤fi(1≤i≤n).\sum_{t=i}^{n}d_t\max\{0,v_t-c_i\}\le f_i\qquad(1\le i\le n).t=i∑n​dt​max{0,vt​−ci​}≤fi​(1≤i≤n).

This establishes feasibility before comparing the greedy objective with the lot-sizing cost. Zero-demand coordinates may have arbitrary values.

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

theorem greedy_forward_feasible (P : Instance) (v : ℕ → ℝ)
    (hd : ∀ t, 1 ≤ t → t ≤ P.n → 0 ≤ P.d t)
    (hf : ∀ i, 1 ≤ i → i ≤ P.n → 0 ≤ P.f i)
    (hv : IsGreedyForward P v) : IsFeasible P v := by sorry

end WagelmansELS.DualGreedy
Source
Wagelmans, Van Hoesel and Kolen, Economic Lot Sizing, Oper. Res. 40 Supp. 1 (1992), p. S153, Section 4, “The solution constructed in this greedy forward way is clearly feasible”
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