Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Every (RUFL)-feasible solution has an (SSP)-feasible counterpart of equal cost

Proved
ReliableFacilityLoc.Scenario.rufl_to_ssp

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

facility-locationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1reliabilitystochastic-programming

Let (X,Y,P)(X,Y,P)(X,Y,P) be a feasible solution of (RUFL), with any number R≥1R \ge 1R≥1 of levels. Then there is an assignment Y′Y'Y′ such that (X,Y′)(X,Y')(X,Y′) is feasible for the scenario-based program (SSP) and

Ψ(X,Y′)=Φ(X,Y,P).\Psi(X,Y') = \Phi(X,Y,P).Ψ(X,Y′)=Φ(X,Y,P).

The paper's Y′Y'Y′ serves customer iii in scenario ω\omegaω by the first facility among her assigned levels that operates in ω\omegaω.

Consequently the optimal value of (SSP) is at most that of (RUFL): "solving (SSP) yields a lower bound to (RUFL)".

Formalization Note The paper applies the construction to an optimal solution of (RUFL), but it uses only feasibility, so the statement is made for every feasible solution. The location vector is kept unchanged (X′=XX' = XX′=X).

Preamble
import Definitions.Def_ReliableFacilityLoc_Scenario_RUFL
import Definitions.Def_ReliableFacilityLoc_Scenario_SSP

open Finset
Formal statement
namespace ReliableFacilityLoc.Scenario

/-- **(RUFL) → (SSP) with equal cost** (Cui–Ouyang–Shen, UCTC-FR-2010-02 (Feb. 2010), A.1, proof
of Proposition 1, p. 33 (PDF 35)). For every (RUFL)-feasible `(X, Y, P)` there is an
(SSP)-feasible `(X', Y')` with `X' = X` and `Ψ(X', Y') = Φ(X, Y, P)`; hence the optimal value of
(SSP) is a lower bound on that of (RUFL) ("solving (SSP) yields a lower bound to (RUFL)").

Formalization Note: the paper starts from an optimal `(X, Y, P)`, but its construction (serve
customer `i` in scenario `ω` by the first operating facility among her assigned levels) uses only
feasibility, so the statement is made for every feasible solution. It holds for every `R ≥ 1`;
`R = J` is not needed in this direction. `X' = X` is built in by reusing `X`. -/
theorem rufl_to_ssp {I J R : ℕ} (D : Instance I J R) (X : Fin J → ℝ)
    (Y P : Fin I → Fin (J + 1) → Fin (R + 1) → ℝ) (h : D.IsRUFLFeasible X Y P) :
    ∃ Y' : Fin I → Fin (J + 1) → FailureScenario J → ℝ,
      D.IsSSPFeasible X Y' ∧ D.sspObjective X Y' = D.ruflObjective X Y P := by sorry

end ReliableFacilityLoc.Scenario
Source
Cui, Ouyang, Shen, Reliable Facility Location Design under the Risk of Disruptions, UCTC-FR-2010-02 (Feb. 2010), Appendix A.1 (proof of Proposition 1), pp. 32–33 (PDF 34–35), construction of (X′, Y′) and the display ending "= Φ(X, Y, P)"
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