Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

DFR policy πDFR(θ)\pi_{\rm DFR}(\theta)πDFR​(θ) (Definition D.1) and DFR demand conditional on positive demand

Definition
owmr_dfr_policy

by Ming Hu · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximation-algorithmsinventoryinventory-theoryoperations-researchrenewal-theorystochastic-control

Fix a network NNN under the standing assumptions of Section 3 and a weight θ\thetaθ. This file defines the constants, the demand condition and the policy of Appendix D.

Constants. λ=2−2\lambda=2-\sqrt2λ=2−2​ (dfrLambda) and γλ=1+λ/2+1+λ2/4≈2.335\gamma_\lambda=1+\lambda/2+\sqrt{1+\lambda^2/4}\approx2.335γλ​=1+λ/2+1+λ2/4​≈2.335 (dfrGamma).

DFR demand. Write Gˉi(x)=P(Di>x)\bar G_i(x)=\mathbb P(D_i>x)Gˉi​(x)=P(Di​>x) for the survival function of retailer iii's one-period demand (survival). Retailer iii has an absolutely continuous DFR distribution conditional on positive demand (DFRPositive) when

  1. P(Di∈A, Di>0)=0\mathbb P(D_i\in A,\ D_i>0)=0P(Di​∈A, Di​>0)=0 for every Lebesgue-null set A⊆RA\subseteq\mathbb RA⊆R, and
  2. the conditional survival function x↦Gˉi(x)/Gˉi(0)=P(Di>x∣Di>0)x\mapsto\bar G_i(x)/\bar G_i(0)=\mathbb P(D_i>x\mid D_i>0)x↦Gˉi​(x)/Gˉi​(0)=P(Di​>x∣Di​>0) is log-convex on [0,∞)[0,\infty)[0,∞): for x,y≥0x,y\ge0x,y≥0 and 0≤η≤10\le\eta\le10≤η≤1,
Gˉi(ηx+(1−η)y)Gˉi(0)≤(Gˉi(x)Gˉi(0))η(Gˉi(y)Gˉi(0))1−η.\frac{\bar G_i(\eta x+(1-\eta)y)}{\bar G_i(0)}\le\Bigl(\frac{\bar G_i(x)}{\bar G_i(0)}\Bigr)^{\eta}\Bigl(\frac{\bar G_i(y)}{\bar G_i(0)}\Bigr)^{1-\eta}.Gˉi​(0)Gˉi​(ηx+(1−η)y)​≤(Gˉi​(0)Gˉi​(x)​)η(Gˉi​(0)Gˉi​(y)​)1−η.

Planning quantities (rule (i)). For a canonical optimum (s^,S^)(\hat s,\hat S)(s^,S^) of retailer iii with width w^=S^−s^\hat w=\hat S-\hat sw^=S^−s^, let UUU be the renewal measure of DiD_iDi​ and M(w^)=U[0,w^)M(\hat w)=U[0,\hat w)M(w^)=U[0,w^), as in (9). Then zw^=Ki/M(w^)z_{\hat w}=K_i/M(\hat w)zw^​=Ki​/M(w^) (dfrZ), mw^=Bw^m_{\hat w}=B_{\hat w}mw^​=Bw^​ is the mirror cost of (s^,S^)(\hat s,\hat S)(s^,S^) (dfrMirror), t0=U{0}/M(w^)t_0=U\{0\}/M(\hat w)t0​=U{0}/M(w^) (dfrT0), and t=min⁡{1,zw^/mw^}t=\min\{1,\sqrt{z_{\hat w}/m_{\hat w}}\}t=min{1,zw^​/mw^​​}, with t=1t=1t=1 if mw^=0m_{\hat w}=0mw^​=0 (dfrT).

Choices (IsDFRChoice N θ c). The FIFO choices c=(si,Si,ai,s0,S0)c=(s_i,S_i,a_i,s_0,S_0)c=(si​,Si​,ai​,s0​,S0​) follow Definition D.1 when:

  1. each retailer with Ki=0K_i=0Ki​=0 uses base stock (si=Sis_i=S_isi​=Si​) at a minimizer SiS_iSi​ of FiF_iFi​, with mirror center ai=Sia_i=S_iai​=Si​;
  2. each retailer with Ki>0K_i>0Ki​>0 has a canonical optimum (s^,S^)(\hat s,\hat S)(s^,S^) at planning setup cost Ki/θK_i/\thetaKi​/θ such that: if t=1t=1t=1, it uses (si,Si)=(s^,S^)(s_i,S_i)=(\hat s,\hat S)(si​,Si​)=(s^,S^) with a mirror center aia_iai​ minimizing its mirror cost; if t<1t<1t<1 and t≤t0t\le t_0t≤t0​, it uses base stock at a minimizer of FiF_iFi​, with ai=Sia_i=S_iai​=Si​; if t0<t<1t_0<t<1t0​<t<1, its width w=Si−siw=S_i-s_iw=Si​−si​ satisfies U[0,w)=t M(w^)U[0,w)=t\,M(\hat w)U[0,w)=tM(w^), its target SiS_iSi​ minimizes the long-run average holding and backlog cost among width-www policies, and aia_iai​ minimizes the mirror cost of (si,Si)(s_i,S_i)(si​,Si​);
  3. the supplier uses s0≤S0s_0\le S_0s0​≤S0​ with long-run average cost J0(K0+Kmax⁡)J_0(K_0+K_{\max})J0​(K0​+Kmax​) (rule (iii) of Definition 1).

The policy πDFR(θ)\pi_{\rm DFR}(\theta)πDFR​(θ) is the deterministic FIFO policy of Definition 1 with the initialization of Appendix B (fifoPolicy N x c), run with such choices. The predicate admits every tie-breaking rule, including the smallest minimizers fixed in Definition D.1.

Definition code
import Definitions.Def_owmr_fifo_policy
import Definitions.Def_owmr_renewal

/-!
# The DFR policy `π_DFR(θ)` (Definition D.1) and the DFR demand assumption (Theorem D.1)

Source: M. Hu, "A 5/2 Guarantee for Echelon Stock (s,S) Policies in One-Warehouse
Multi-Retailer Systems", Appendix D (Smaller Constants for DFR Demand): Definition D.1 (DFR
Policy), Theorem D.1 (DFR Demand), and the quantities `M(w) = U[0,w)` and `U` of (9).

The policy `π_DFR(θ)` runs the FIFO mechanism of Definition 1 (rules (ii) and (iii), including
the initialization of Appendix B) with retailer policies and mirror centers selected by the rules
below; it is therefore `fifoPolicy N x c` for a choice `c` satisfying `IsDFRChoice N θ c`.
As in `IsFIFOChoice`, the predicate allows every tie-breaking rule.
-/

open MeasureTheory
open scoped ENNReal NNReal

noncomputable section

namespace OWMR

variable {n : ℕ}

/-- `λ = 2 - √2` (Theorem D.1). -/
def dfrLambda : ℝ := 2 - Real.sqrt 2

/-- `γ_λ = 1 + λ/2 + √(1 + λ²/4)` (Theorem D.1), approximately `2.335`. -/
def dfrGamma : ℝ := 1 + dfrLambda / 2 + Real.sqrt (1 + dfrLambda ^ 2 / 4)

/-- The survival function `x ↦ ℙ(D_i > x)` of retailer `i`'s one-period demand. -/
def Network.survival (N : Network n) (i : Fin n) (x : ℝ) : ℝ :=
  (N.marginal i {z : ℝ≥0 | x < (z : ℝ)}).toReal

/-- Retailer `i`'s demand has an absolutely continuous DFR distribution conditional on positive
demand (Theorem D.1):
* absolute continuity: `ℙ(D_i ∈ A, D_i > 0) = 0` for every Lebesgue-null set `A ⊆ ℝ`;
* DFR: the conditional survival function `F̄(x) = ℙ(D_i > x | D_i > 0) = ℙ(D_i > x)/ℙ(D_i > 0)`
  is log-convex on `[0, ∞)`: `F̄(ηx + (1-η)y) ≤ F̄(x)^η F̄(y)^(1-η)` for `x, y ≥ 0`,
  `0 ≤ η ≤ 1`. -/
def Network.DFRPositive (N : Network n) (i : Fin n) : Prop :=
  (∀ A : Set ℝ, volume A = 0 → N.marginal i {z : ℝ≥0 | (z : ℝ) ∈ A ∧ 0 < (z : ℝ)} = 0) ∧
  ∀ x y η : ℝ, 0 ≤ x → 0 ≤ y → 0 ≤ η → η ≤ 1 →
    N.survival i (η * x + (1 - η) * y) / N.survival i 0
      ≤ (N.survival i x / N.survival i 0) ^ η * (N.survival i y / N.survival i 0) ^ (1 - η)

/-- Definition D.1 (i): `z_ŵ = K/M(ŵ)` for retailer `i` and a canonical optimum `(ŝ, Ŝ)` of
width `ŵ = Ŝ - ŝ`, with `M(ŵ) = U[0, ŵ)`. -/
def Network.dfrZ (N : Network n) (i : Fin n) (sh Sh : ℝ) : ℝ :=
  N.K i / (renewalM (N.marginal i) (Sh - sh)).toReal

/-- Definition D.1 (i): `m_ŵ = B_ŵ`, the mirror cost of the width-`ŵ` policy `(ŝ, Ŝ)`. -/
def Network.dfrMirror (N : Network n) (i : Fin n) (sh Sh : ℝ) : ℝ :=
  (mirrorCost (N.marginal i) N.h N.p sh Sh).toReal

/-- Definition D.1 (i): `t₀ = U{0}/M(ŵ)`. -/
def Network.dfrT0 (N : Network n) (i : Fin n) (sh Sh : ℝ) : ℝ :=
  (renewalMeasure (N.marginal i) {0}).toReal / (renewalM (N.marginal i) (Sh - sh)).toReal

/-- Definition D.1 (i): `t = min{1, √(z_ŵ/m_ŵ)}`, with `t = 1` if `m_ŵ = 0`. -/
def Network.dfrT (N : Network n) (i : Fin n) (sh Sh : ℝ) : ℝ :=
  if N.dfrMirror i sh Sh = 0 then 1
  else min 1 (Real.sqrt (N.dfrZ i sh Sh / N.dfrMirror i sh Sh))

/-- The requirements of Definition D.1 on the choices `c` of `π_DFR(θ)`.
* (ii) A retailer with `K_i = 0` uses base stock (`s_i = S_i`) at a minimizer of `F_i`; by (iii)
  its mirror center is its target.
* (i)-(iii) A retailer with `K_i > 0` takes a canonical optimum `(ŝ, Ŝ)` at planning setup cost
  `K_i/θ` and computes `t` and `t₀`. If `t = 1` it uses `(ŝ, Ŝ)`. If `t < 1` and `t ≤ t₀` it uses
  base stock at a minimizer of `F_i`, with mirror center equal to its target. If `t < 1` and
  `t₀ < t` it uses a width-`w_t` policy with `U[0, w_t) = t M(ŵ)` whose target minimizes the
  long-run average holding and backlog cost among width-`w_t` policies. In the `(s,S)` cases
  the mirror center minimizes the mirror cost of the selected policy.
* (iv), via rule (iii) of Definition 1: the supplier `(s₀, S₀)` policy attains the supplier
  value `J₀(K₀ + K_max)`. -/
def IsDFRChoice (N : Network n) (θ : ℝ) (c : FIFOChoice n) : Prop :=
  (∀ i, N.K i = 0 → c.s i = c.S i ∧ (∀ y, N.F i (c.S i) ≤ N.F i y) ∧ c.a i = c.S i) ∧
  (∀ i, 0 < N.K i → ∃ sh Sh : ℝ,
    IsCanonicalOptimum (N.marginal i) (N.F i) (N.K i / θ) sh Sh ∧
    (N.dfrT i sh Sh = 1 → c.s i = sh ∧ c.S i = Sh ∧
      mirrorAvg (N.marginal i) N.h N.p sh Sh (c.a i) = mirrorCost (N.marginal i) N.h N.p sh Sh) ∧
    (N.dfrT i sh Sh < 1 → N.dfrT i sh Sh ≤ N.dfrT0 i sh Sh →
      c.s i = c.S i ∧ (∀ y, N.F i (c.S i) ≤ N.F i y) ∧ c.a i = c.S i) ∧
    (N.dfrT i sh Sh < 1 → N.dfrT0 i sh Sh < N.dfrT i sh Sh →
      renewalM (N.marginal i) (c.S i - c.s i)
          = ENNReal.ofReal (N.dfrT i sh Sh) * renewalM (N.marginal i) (Sh - sh) ∧
      (∀ S' : ℝ, ssAvgCost (N.marginal i) (N.F i) 0 (c.s i) (c.S i)
        ≤ ssAvgCost (N.marginal i) (N.F i) 0 (S' - (c.S i - c.s i)) S') ∧
      mirrorAvg (N.marginal i) N.h N.p (c.s i) (c.S i) (c.a i)
        = mirrorCost (N.marginal i) N.h N.p (c.s i) (c.S i))) ∧
  c.s0 ≤ c.S0 ∧
  ssAvgCost N.aggregate N.fL0 (N.K0 + N.Kmax) c.s0 c.S0 = N.J0 (N.K0 + N.Kmax)

end OWMR
Source
M. Hu, "A 5/2 Guarantee for Echelon Stock (s,S) Policies in One-Warehouse Multi-Retailer Systems", working paper (manuscript of November 2026), Appendix D, Definition D.1 (DFR Policy), p. E.23, and the demand assumption of Theorem D.1 (DFR Demand), p. E.24; renewal quantities UUU and MMM in (9) and mirror cost BwB_wBw​ in (14).

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