Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.2, after Theorem 3 — routes with c̃_kl ≥ z(UB) − z(RF-bar) are absent from every solution cheaper than z(UB)

Proved
TwoEchelonCVRP.LowerBound.rfbar_elimination

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

lower-boundp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1reduced-costvehicle-routing

Consider a 2E-CVRP instance with positive demands and route families M\mathcal MM, R\mathcal RR. Let λ∈RNC\lambda \in \mathbb R^{N_C}λ∈RNC​, μk≤0\mu_k \le 0μk​≤0, μ0≤0\mu_0 \le 0μ0​≤0, let β\betaβ satisfy (12), and let c~kl=ckl−∑iaikl(βik+λi)−μk−μ0\tilde c_{kl} = c_{kl} - \sum_i a_{ikl}(\beta_{ik} + \lambda_i) - \mu_k - \mu_0c~kl​=ckl​−∑i​aikl​(βik​+λi​)−μk​−μ0​ be the reduced costs. Let z(UB)z(\mathrm{UB})z(UB) be a real number. Then every feasible solution of FFF of cost smaller than z(UB)z(\mathrm{UB})z(UB) uses no second-level route l∈Rkl \in \mathcal R_kl∈Rk​ with

c~kl≥z(UB)−z(RF‾(β,λ,μ));\tilde c_{kl} \ge z(\mathrm{UB}) - z(\overline{RF}(\beta,\lambda,\mu));c~kl​≥z(UB)−z(RF(β,λ,μ));

that is, every route lll it uses satisfies c~kl+z(RF‾(β,λ,μ))<z(UB)\tilde c_{kl} + z(\overline{RF}(\beta,\lambda,\mu)) < z(\mathrm{UB})c~kl​+z(RF(β,λ,μ))<z(UB).

This is the route-elimination test the paper applies with the bound of RF‾\overline{RF}RF, which is cheap to compute.

Formalization Note The paper speaks of optimal solutions of cost below a known upper bound; the statement is proved for every feasible solution of cost below z(UB)z(\mathrm{UB})z(UB), and z(UB)z(\mathrm{UB})z(UB) is any real number (whether it is an upper bound is not used): both are strengthenings. The inequality is written with an addition instead of a subtraction because z(RF‾)z(\overline{RF})z(RF) is an extended real.

Preamble
import Mathlib
import Definitions.Def_TwoEchelonCVRP_LowerBound_Model
import Definitions.Def_TwoEchelonCVRP_LowerBound_RF
import Definitions.Def_TwoEchelonCVRP_LowerBound_RFbar
Formal statement
namespace TwoEchelonCVRP.LowerBound

/-- §3.2, the sentence after Theorem 3 (p. 302): if `β` solves (12) and `μ ≤ 0`, `μ_0 ≤ 0`, a
feasible solution of F of cost smaller than `zUB` uses no second-level route `l` with
`c̃_l ≥ zUB − z(RF-bar(β, λ, μ))`; stated as `c̃_l + z(RF-bar) < zUB` for every used route. -/
theorem rfbar_elimination (I : Instance) (RS : RouteSystem I)
    (β : Fin I.nc → Fin I.ns → ℝ) (lam : Fin I.nc → ℝ) (μ : Fin I.ns → ℝ) (μ0 : ℝ)
    (hμ : ∀ k, μ k ≤ 0) (hμ0 : μ0 ≤ 0) (hβ : SatisfiesPenalty RS β lam μ μ0)
    (zUB : ℝ) (s : SolF RS) (hs : IsFeasibleF RS s) (hcost : costF RS s < zUB)
    (l : RS.SR) (hl : s.x l = true) :
    ((reducedCost RS β lam μ μ0 l : ℝ) : EReal) + zRFbar RS β lam μ μ0
      < ((zUB : ℝ) : EReal) := by sorry

end TwoEchelonCVRP.LowerBound
Source
Baldacci, Mingozzi, Roberti & Wolfler Calvo, An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem, Oper. Res. 61(2) (2013), p. 302, §3.2, the paragraph after Theorem 3
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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