Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix G, Proof of Lemma 2, p. 42 — the restriction of a dual feasible solution of RF1 bounds φ(SF1_r) from below

Proved
OnDemandDelivery.RouteElim.rf1r_dual_bound

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

linear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1vehicle-routingweak-duality

In the routing subproblem of one period nnn, let (μˉ,μˉn,νˉ)(\bar\mu,\bar\mu_n,\bar\nu)(μˉ​,μˉ​n​,νˉ) be a dual feasible solution of the LP relaxation RF1: μˉn′≤0\bar\mu_{n'}\le 0μˉ​n′​≤0, μˉn≤0\bar\mu_n\le 0μˉ​n​≤0, νˉi≥0\bar\nu_i\ge 0νˉi​≥0, and ∑iαi,r′νˉi+∑n′βn′,r′μˉn′+μˉn≤cr′\sum_i\alpha_{i,r'}\bar\nu_i+\sum_{n'}\beta_{n',r'}\bar\mu_{n'}+\bar\mu_n\le c_{r'}∑i​αi,r′​νˉi​+∑n′​βn′,r′​μˉ​n′​+μˉ​n​≤cr′​ for every route r′r'r′. Fix a route rrr and let Irn={i∣αi,r=0}\mathcal I^n_r=\{i\mid \alpha_{i,r}=0\}Irn​={i∣αi,r​=0}. Then:

  1. (μˉ,μˉn,{νˉi}i∈Irn)(\bar\mu,\bar\mu_n,\{\bar\nu_i\}_{i\in\mathcal I^n_r})(μˉ​,μˉ​n​,{νˉi​}i∈Irn​​) is a dual feasible solution of the restricted LP RF1r_rr​ (75)–(79);
  2. its dual objective
Br=∑n′=n+1N∑k=0Kˉμˉn′kzˉkn′−∑n′=n+1Nβn′,rμˉn′+μˉn(Kˉ−ζnn−1)+∑i∈IrnνˉiB_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_iBr​=n′=n+1∑N​k=0∑Kˉ​μˉ​n′​kzˉkn′​−n′=n+1∑N​βn′,r​μˉ​n′​+μˉ​n​(Kˉ−ζnn​−1)+i∈Irn​∑​νˉi​

is at most the cost of every feasible solution of RF1r_rr​; 3. hence Br≤ϕ(SF1r)B_r\le\phi(\mathrm{SF1}_r)Br​≤ϕ(SF1r​), the optimal cost of the restricted integer program.

This bound is the computable substitute for ϕ(SF1r)\phi(\mathrm{SF1}_r)ϕ(SF1r​) in the elimination test (74).

Formalization Note The page assumes (μˉ,νˉ)(\bar\mu,\bar\nu)(μˉ​,νˉ) dual optimal for RF1; the statement assumes only dual feasibility, which is all the argument needs, so it is a strengthening. The inequality Br≤ϕ(SF1r)B_r\le\phi(\mathrm{SF1}_r)Br​≤ϕ(SF1r​) is stated in the extended reals; it holds trivially when SF1r_rr​ is infeasible. 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 rf1r_dual_bound {R I P : Type} [Fintype R] [Fintype I] [Fintype P]
    (D : Data R I P) (hD : D.Standing)
    (μ : P → ℝ) (μn : ℝ) (ν : I → ℝ) (hdual : D.DualFeasible μ μn ν) (r : R) :
    D.RF1rDualFeasible r μ μn ν ∧
      (∀ θ', D.RF1rFeasible r θ' → D.rf1rBound r μ μn ν ≤ D.cost θ') ∧
      ((D.rf1rBound r μ μn ν : ℝ) : EReal) ≤ D.phiSF1r 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, after (75)–(79)
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