Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.1 — LB_R is a lower bound on the second-level routing cost

Proved
TwoEchelonCVRP.Config.lbr_lower_bound

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

lower-boundp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1two-echelonvehicle-routing

Let λ∈RNC\lambda\in\mathbb R^{N_C}λ∈RNC​ be arbitrary, let μk≤0\mu_k\le0μk​≤0 for every satellite kkk and μ0≤0\mu_0\le0μ0​≤0, and let β\betaβ satisfy the penalty system (12). Assume there is at least one satellite. Then for every feasible solution (x,y,q)(x,y,q)(x,y,q) of formulation FFF,

LBR≤∑k∈NS∑l∈Rkcklxkl.\mathrm{LB}_R\le\sum_{k\in N_S}\sum_{l\in\mathcal R_k}c_{kl}x_{kl}.LBR​≤k∈NS​∑​l∈Rk​∑​ckl​xkl​.

The paper states this for optimal solutions; it holds for every feasible one. It is the bound used in condition (d) of Proposition 1.

Formalization Note The paper takes the specific penalties that produce the bound LD1; here any penalties with μ≤0\mu\le0μ≤0, μ0≤0\mu_0\le0μ0​≤0 and (12) are allowed, a generalization.

Preamble
import Mathlib
import Definitions.Def_TwoEchelonCVRP_Config_Bounds
Formal statement
namespace TwoEchelonCVRP.Config

/-- §5.1, p. 305: for penalties `μ ≤ 0`, `μ_0 ≤ 0`, any `λ` and any `β` satisfying (12), `LB_R` is
at most the second-level routing cost `∑_{k ∈ N_S} ∑_{l ∈ 𝓡_k} c_{kl} x_{kl}` of every feasible
solution of F. -/
theorem lbr_lower_bound (I : Instance) (RS : RouteSystem I) (hns : 0 < I.ns)
    (β : 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)
    (s : SolF RS) (hs : IsFeasibleF RS s) :
    LBR hns β lam μ μ0 ≤ secondLevelCost RS s := by sorry

end TwoEchelonCVRP.Config
Source
Baldacci, Mingozzi, Roberti & Wolfler Calvo, An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem, Oper. Res. 61(2) (2013), p. 305, §5.1, the definition of LB_R
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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