Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix G, Proof of Lemma 2, p. 42, (80)–(81) — for a dual optimal solution of RF1, the bound test (80) is the reduced-cost test (81)

Proved
OnDemandDelivery.RouteElim.eq80_iff_eq81

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

linear-programminglp-dualityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1reduced-costvehicle-routing

In the routing subproblem of one period nnn (with the standing assumptions αi,r,βn′,r∈{0,1}\alpha_{i,r},\beta_{n',r}\in\{0,1\}αi,r​,βn′,r​∈{0,1}), suppose the LP relaxation RF1 attains its optimal cost ϕ(RF1)\phi(\mathrm{RF1})ϕ(RF1), and let (μˉ,μˉn,νˉ)(\bar\mu,\bar\mu_n,\bar\nu)(μˉ​,μˉ​n​,νˉ) be a dual optimal solution of RF1. For every real ububub and every route rrr,

cr+∑n′=n+1N∑k=0Kˉμˉn′kzˉkn′−∑n′=n+1Nβn′,rμˉn′+μˉn(Kˉ−ζnn−1)+∑i∈Irnνˉi>ub(80)c_r+\sum_{n'=n+1}^N\sum_{k=0}^{\bar K}\bar\mu_{n'}k\bar z^{n'}_k-\sum_{n'=n+1}^N\beta_{n',r}\bar\mu_{n'}+\bar\mu_n(\bar K-\zeta^n_n-1)+\sum_{i\in\mathcal I^n_r}\bar\nu_i>ub \tag{80}cr​+n′=n+1∑N​k=0∑Kˉ​μˉ​n′​kzˉkn′​−n′=n+1∑N​βn′,r​μˉ​n′​+μˉ​n​(Kˉ−ζnn​−1)+i∈Irn​∑​νˉi​>ub(80)

holds if and only if

cr−∑i∈Inαi,rνˉi−∑n′=n+1Nβn′,rμˉn′−μˉn>ub−ϕ(RF1).(81)c_r-\sum_{i\in\mathcal I^n}\alpha_{i,r}\bar\nu_i-\sum_{n'=n+1}^N\beta_{n',r}\bar\mu_{n'}-\bar\mu_n>ub-\phi(\mathrm{RF1}). \tag{81}cr​−i∈In∑​αi,r​νˉi​−n′=n+1∑N​βn′,r​μˉ​n′​−μˉ​n​>ub−ϕ(RF1).(81)

Here Irn={i∣αi,r=0}\mathcal I^n_r=\{i\mid\alpha_{i,r}=0\}Irn​={i∣αi,r​=0}.

The equivalence turns the dual bound of RF1r_rr​ into a test on the reduced cost of rrr in RF1, which needs only one LP solve for all routes.

Formalization Note "The optimal cost ϕ(RF1)\phi(\mathrm{RF1})ϕ(RF1)" is the attained minimum of the cost over the RF1 feasible set, and "dual optimal" means maximal dual objective over the dual feasible set; the equality of ϕ(RF1)\phi(\mathrm{RF1})ϕ(RF1) with the dual objective of (μˉ,μˉn,νˉ)(\bar\mu,\bar\mu_n,\bar\nu)(μˉ​,μˉ​n​,νˉ) is not assumed. The double sum is written ∑n′μˉn′bn′\sum_{n'}\bar\mu_{n'}b_{n'}∑n′​μˉ​n′​bn′​ with bn′=∑kkzˉkn′b_{n'}=\sum_k k\bar z^{n'}_kbn′​=∑k​kzˉkn′​.

Preamble
import Mathlib
import Definitions.Def_OnDemandDelivery_RouteElim_Setting
Formal statement
namespace OnDemandDelivery.RouteElim

theorem eq80_iff_eq81 {R I P : Type} [Fintype R] [Fintype I] [Fintype P]
    (D : Data R I P) (hD : D.Standing)
    (φ : ℝ) (hφ : IsLeast (D.cost '' {θ | D.RF1Feasible θ}) φ)
    (μ : P → ℝ) (μn : ℝ) (ν : I → ℝ) (hdual : D.DualOptimal μ μn ν)
    (ub : ℝ) (r : R) :
    ub < D.c r + D.rf1rBound r μ μn ν ↔ ub - φ < D.reducedCost μ μn ν r := by sorry

end OnDemandDelivery.RouteElim
Source
Liu, Luo, On-Demand Delivery from Stores: Dynamic Dispatching and Routing with Random Demand, arXiv:2107.13058v3, p. 42, Appendix G, Proof of Lemma 2, (80)–(81)
Human review
  • Endorsed by Shuze Chen · Oct 16, 2026

    Confirmed by the moderator at approval.

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