Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.2, p. 1431 — a dominated triplet (b, d₂, t) can be set to zero in some optimal solution

Proved
OpenPitMIP.UltPit.dominated_triplet

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

mixed-integer-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1preprocessingproduction-scheduling

Consider an instance of the PCPSP-C with either integrality condition, a block bbb, two distinct destinations d1≠d2d_1 \ne d_2d1​=d2​ and a period ttt. Write Gb,d,tG_{b,d,t}Gb,d,t​ for the column of GGG that multiplies yb,d,ty_{b,d,t}yb,d,t​. Suppose the triplet (b,d1,t)(b, d_1, t)(b,d1​,t) dominates (b,d2,t)(b, d_2, t)(b,d2​,t):

Gb,d1,t≤Gb,d2,t (componentwise)andpb,d1,t≥pb,d2,t.G_{b,d_1,t} \le G_{b,d_2,t} \ \text{(componentwise)} \qquad\text{and}\qquad p_{b,d_1,t} \ge p_{b,d_2,t}.Gb,d1​,t​≤Gb,d2​,t​ (componentwise)andpb,d1​,t​≥pb,d2​,t​.

If the PCPSP-C has an optimal solution, then it has an optimal solution (x,y)(x, y)(x,y) with yb,d2,t=0y_{b,d_2,t} = 0yb,d2​,t​=0.

This justifies the dominated-triplet preprocessing: the variable yb,d2,ty_{b,d_2,t}yb,d2​,t​ can be removed from the model without changing the optimal value.

Formalization Note The comparison is between the discounted values pb,d,t=pb,d/(1+r)tp_{b,d,t} = p_{b,d}/(1+r)^tpb,d,t​=pb,d​/(1+r)t, as on the page. The hypothesis d1≠d2d_1 \ne d_2d1​=d2​ is implicit in "dominates" (with d1=d2d_1 = d_2d1​=d2​ every triplet would dominate itself, and the conclusion would be false in general).

Preamble
import Mathlib
import Definitions.Def_OpenPitMIP_UltPit_Setting
Formal statement
namespace OpenPitMIP.UltPit

open PCPSPC

/-- §4.2, p. 1431: if the triplet `(b, d₁, t)` dominates `(b, d₂, t)` — the column `G_{b,d₁,t}`
is componentwise at most `G_{b,d₂,t}` and `p_{b,d₁,t} ≥ p_{b,d₂,t}` — then, whenever the
PCPSP-C has an optimal solution, it has one with `y_{b,d₂,t} = 0`. -/
theorem dominated_triplet {B D C : Type} [Fintype B] [Fintype D] [Fintype C] {T m : ℕ}
    (I : PCPSPC B D C T m) (κ : Integrality) (b : B) (d₁ d₂ : D) (hd : d₁ ≠ d₂) (t : Fin T)
    (hG : ∀ i, I.G i b d₁ t ≤ I.G i b d₂ t) (hp : I.value b d₁ t ≥ I.value b d₂ t)
    (hopt : ∃ x y, I.Optimal κ x y) :
    ∃ x y, I.Optimal κ x y ∧ y b d₂ t = 0 := by sorry

end OpenPitMIP.UltPit
Source
Oper. Res. 68(5), §4.2, p. 1431
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