Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 8, p. 1435 — predecessors S, the blocks of c̄ and b(R) share the capacity U_s^d of destination d

Proved
OpenPitMIP.Hourglass.capacity_split

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

knapsackmixed-integer-programmingopen-pit-miningp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1production-scheduling

Consider an instance of the PCPSP-C satisfying the standing assumptions. Fix a destination ddd, a cluster cˉ\bar ccˉ, a set S⊆b(cl(cˉ)∖{cˉ})S\subseteq b(cl(\bar c)\setminus\{\bar c\})S⊆b(cl(cˉ)∖{cˉ}) of blocks of strict predecessors of cˉ\bar ccˉ, and let R=rcl(cˉ)∖{cˉ}R=rcl(\bar c)\setminus\{\bar c\}R=rcl(cˉ)∖{cˉ}. If y≥0y\ge 0y≥0 satisfies the destination capacity rows (9), ∑bqbyb,d,s≤Usd\sum_{b}q_b y_{b,d,s}\le U^d_s∑b​qb​yb,d,s​≤Usd​, then for every period sss

∑b∈Sqb yb,d,s+∑b∈cˉqb yb,d,s+∑b∈b(R)qb yb,d,s≤Usd.\sum_{b\in S}q_b\,y_{b,d,s}+\sum_{b\in\bar c}q_b\,y_{b,d,s}+\sum_{b\in b(R)}q_b\,y_{b,d,s}\le U^d_s .b∈S∑​qb​yb,d,s​+b∈cˉ∑​qb​yb,d,s​+b∈b(R)∑​qb​yb,d,s​≤Usd​.

This is the capacity inequality from which the proof of Theorem 8 starts, before summing over s=t1,…,ts=t_1,\dots,ts=t1​,…,t.

Formalization Note The page writes "∀s≤t\forall s\le t∀s≤t"; the inequality holds for every period sss and is stated so. Only nonnegativity of yyy and the rows (9) are assumed about yyy.

Preamble
import Mathlib
import Definitions.Def_OpenPitMIP_Hourglass_Setting
Formal statement
namespace OpenPitMIP.Hourglass

/-- Proof of Theorem 8, p. 1435: for a cluster `c̄`, a set `S` of blocks of strict predecessors of
`c̄` and `R = rcl(c̄) \ {c̄}`, every nonnegative `y` satisfying the destination capacity rows (9)
satisfies, for every period `s`,
`∑_{b∈S} q_b y_{b,d,s} + ∑_{b∈c̄} q_b y_{b,d,s} + ∑_{b∈b(R)} q_b y_{b,d,s} ≤ U_s^d`. -/
theorem capacity_split {B D C : Type} [Fintype B] [Fintype D] [Fintype C]
    [DecidableEq B] [DecidableEq C] {T m : ℕ}
    (I : PCPSPC B D C T m) (hI : I.Standing) (d : D) (cbar : C) (S : Finset B)
    (hS : S ⊆ I.blocksOf (I.cl cbar \ {cbar}))
    (y : B → D → Fin T → ℝ) (hy0 : ∀ b d t, 0 ≤ y b d t) (hcap : I.DestCap y) :
    ∀ s : Fin T,
      ∑ b ∈ S, I.q b * y b d s + ∑ b ∈ I.blocksOf {cbar}, I.q b * y b d s
        + ∑ b ∈ I.blocksOf (I.rcl cbar \ {cbar}), I.q b * y b d s ≤ I.Ud d s := by sorry

end OpenPitMIP.Hourglass
Source
Oper. Res. 68(5), proof of Theorem 8, p. 1435
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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