Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.1 — LBW(M) is a lower bound on z(F(M))

Proved
TwoEchelonCVRP.Config.lbw_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). For every set MMM of first-level routes visiting at least one satellite,

LBW(M)≤z(F(M)).\mathrm{LBW}(M)\le z(F(M)).LBW(M)≤z(F(M)).

It is the bound used in condition (e) of Proposition 1 and in the order in which the exact method examines configurations.

Formalization Note The comparison is in EReal, so it is trivially true when F(M)F(M)F(M) is infeasible (z(F(M))=+∞z(F(M))=+\inftyz(F(M))=+∞). The paper takes the penalties producing LD1; any admissible ones are allowed here, and MMM need not belong to P\mathcal PP.

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), and every
configuration `M` with `N_S(M)` nonempty, `LBW(M) ≤ z(F(M))`. -/
theorem lbw_lower_bound (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)
    (M : Finset RS.FR) (hM : (NS RS M).Nonempty) :
    ((LBW RS β lam μ μ0 M hM : ℝ) : EReal) ≤ zFM RS M := 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 LBW(M)
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