Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix D, p. 42 — optimal DLP allocation on the two-class instance

Proved
ResolvingNRM.FRLower.lp_solution

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

linear-programmingnetwork-revenue-managementp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let 0<r2<r10<r_2<r_10<r2​<r1​ and consider the two-class instance with one unit of resource consumed by either accepted customer. For any nonnegative average resource capacity bbb, every optimal DLP allocation x=(x1,x2)x=(x_1,x_2)x=(x1​,x2​) satisfies

x1=min⁡{b,1},x2=min⁡{max⁡{b−1,0},1}.x_1=\min\{b,1\},\qquad x_2=\min\{\max\{b-1,0\},1\}.x1​=min{b,1},x2​=min{max{b−1,0},1}.

The first coordinate is the admission probability for class 1 used in the paper's phase-two argument; the second determines the class-2 admission probability when capacity exceeds one.

Formalization Note The page states the x1x_1x1​ formula explicitly; the x2x_2x2​ formula is the unique optimal companion under 0<r2<r10<r_2<r_10<r2​<r1​ and is used implicitly in (64)–(65). Nonnegative bbb is the domain of the policy's LP.

Preamble
import Mathlib
import Definitions.Def_ResolvingNRM_FRLower_Instance
Formal statement
namespace ResolvingNRM.FRLower

/-- The unique optimal DLP allocation of the two-class instance. The first equality is
stated on p. 42; the second is the implicit companion used in (64)–(65). -/
theorem lp_solution (r₁ r₂ : ℝ) (hr₂ : 0 < r₂) (hr : r₂ < r₁)
    (b : Fin 1 → ℝ) (hb : 0 ≤ b 0) (x : Fin 2 → ℝ)
    (hx : IsDLPOptimal (twoClass r₁ r₂ (le_of_lt hr₂) (le_of_lt hr)) b x) :
    x 0 = min (b 0) 1 ∧ x 1 = min (max (b 0 - 1) 0) 1 := by sorry

end ResolvingNRM.FRLower
Source
Bumpensanti, Wang, A Re-solving Heuristic with Uniformly Bounded Loss for Network Revenue Management, arXiv:1802.06192v3, Appendix D, p. 42, paragraph before (61) and (64)–(65)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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