Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The split formulation (19a)–(19l) is a relaxation of (RSPi_ii​)

Proved
ReliableFacilityLoc.RRSP.split_relaxes_rsp

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

facility-locationoperations-researchp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1reliability

Let (Y,P,W)(Y, P, W)(Y,P,W) be feasible for the relaxed subproblem (RSPi_ii​). Then (Y,Z,P,W)(Y, Z, P, W)(Y,Z,P,W) with Z=YZ = YZ=Y is feasible for the split formulation (19a)–(19l), and its cost equals the (RSPi_ii​) objective:

G(Y,Y,P)=∑j=0J∑r=0RλidijWjr+∑j=0J−1∑r=0R−1μijYjr.G(Y, Y, P) = \sum_{j=0}^{J}\sum_{r=0}^{R} \lambda_i d_{ij} W_{jr} + \sum_{j=0}^{J-1}\sum_{r=0}^{R-1} \mu_{ij} Y_{jr}.G(Y,Y,P)=j=0∑J​r=0∑R​λi​dij​Wjr​+j=0∑J−1​r=0∑R−1​μij​Yjr​.

Hence the optimal value of the split formulation is at most the optimal value of (RSPi_ii​). This is the last step of the proof of Proposition 4.

Formalization Note No assumption on the data is needed. Feasibility and cost are those of the RSP and split-formulation definitions.

Preamble
import Mathlib
import Definitions.Def_ReliableFacilityLoc_RRSP_RSP
import Definitions.Def_ReliableFacilityLoc_RRSP_Split

open Finset
Formal statement
namespace ReliableFacilityLoc.RRSP

/-- **The split formulation (19a)–(19l) is a relaxation of (RSP_i)** (Cui, Ouyang & Shen,
UCTC-FR-2010-02 (Feb. 2010), Appendix A.4, p. 39, PDF 41, last paragraph; unnumbered). Every
feasible solution `(Y, P, W)` of (RSP_i) gives the feasible solution `(Y, Z, P, W)` with `Z = Y` of
the split formulation (this is constraint (19m)), with the same cost: `G(Y, Y, P) = Φ_i`.

Printed: "Since formulation (19a) - (19l) is a relaxation of (RSP), it follows that (RRSP) yields a
lower bound for (RSP)."

Formalization Note: the split formulation is the one of `IsSplitFeasible` / `splitObjective`
(with the objective the proof of Lemma 1 uses, see there). No hypothesis on the data is needed. -/
theorem split_relaxes_rsp {J R : ℕ} (lam : ℝ) (d : Fin J → ℝ) (phi : ℝ) (q : Fin J → ℝ)
    (mu : Fin J → ℝ) (Y P W : Fin (J + 1) → Fin (R + 1) → ℝ) (h : IsRSPFeasible q Y P W) :
    IsSplitFeasible q Y Y P W ∧
      splitObjective lam d phi mu Y W = rspObjective lam d phi mu Y W := by sorry

end ReliableFacilityLoc.RRSP
Source
Cui, Ouyang, Shen, Reliable Facility Location Design under the Risk of Disruptions, UCTC-FR-2010-02 (Feb. 2010), p. 39 (PDF 41), Appendix A.4, last paragraph of the proof of Proposition 4 (unnumbered)
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