Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

App. B.2, p. 333 — YΔ=Y−HΔBY_\Delta = Y - H\Delta_BYΔ​=Y−HΔB​ is the unique optimum of DLP[C−Δ,λ][C-\Delta,\lambda][C−Δ,λ]

Proved
ChoicePAC.MidPoint.perturbation_unique_optimum

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

linear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1perturbation

Consider a valid instance satisfying Assumptions 2.1 and 2.2, let YYY be the optimal solution of DLP[C,λ]\mathrm{DLP}[C,\lambda]DLP[C,λ], and let Δ∈Rm\Delta \in \mathbb R^mΔ∈Rm. Define YΔY_\DeltaYΔ​ by YΔ,j=YjY_{\Delta,j} = Y_jYΔ,j​=Yj​ for j∈Jλ∪J0j \in J_\lambda \cup J_0j∈Jλ​∪J0​ and

YΔ,y=Yy−W−1[ΔB0]=Yy−HΔB.Y_{\Delta,y} = Y_y - W^{-1}\begin{bmatrix}\Delta_B\\ 0\end{bmatrix} = Y_y - H\Delta_B .YΔ,y​=Yy​−W−1[ΔB​0​]=Yy​−HΔB​.

If the feasibility conditions

[AˉNPN]YΔ<[CN−ΔNλN]andYΔ,y>0\begin{bmatrix}\bar A_N\\ P_N\end{bmatrix}Y_\Delta < \begin{bmatrix}C_N - \Delta_N\\ \lambda_N\end{bmatrix} \quad\text{and}\quad Y_{\Delta,y} > 0[AˉN​PN​​]YΔ​<[CN​−ΔN​λN​​]andYΔ,y​>0

hold (componentwise; NNN denotes the nonbinding resources and types at YYY), then YΔY_\DeltaYΔ​ is the unique optimal solution of DLP[C−Δ,λ]\mathrm{DLP}[C-\Delta,\lambda]DLP[C−Δ,λ].

This is how the paper tracks the re-solved DLP solution of PAC when the remaining capacity deviates from its fluid path.

Formalization Note The page motivates the claim for "sufficiently small" Δ\DeltaΔ, but the claim is made under the displayed conditions, so Lean takes every Δ\DeltaΔ satisfying them. The standing hypotheses (IsValid) are the disclosed reading of Sec. 2.1, p. 315, Sec. 2.3, p. 317 and Sec. 5.2, p. 327: printed are λq≥0\lambda_q \ge 0λq​≥0, bounded nonnegative consumption and rj(0)=0r_j(0)=0rj​(0)=0; read in are C≥0C \ge 0C≥0, consumption laws that are probability measures, Aij≤ξjA_{ij} \le \xi_jAij​≤ξj​ almost surely (the page writes ξj≥Aij\xi_j \ge A_{ij}ξj​≥Aij​ on p. 317 and Aij<ξjA_{ij} < \xi_jAij​<ξj​ on p. 327; the weaker ≤\le≤ is used), measurable revenue functions, and revenue that is nonnegative and bounded by a common constant (implicit on the page, needed in App. C.4).

Preamble
import Mathlib
import Definitions.Def_ChoicePAC_MidPoint_Model
import Definitions.Def_ChoicePAC_MidPoint_Assumptions
Formal statement
namespace ChoicePAC.MidPoint
open Matrix in
theorem perturbation_unique_optimum {NT n m : ℕ} (I : Instance NT n m) (hI : I.IsValid)
    (h21 : I.Assumption21) (h22 : I.Assumption22) (Y : Fin n → ℝ)
    (hY : I.IsDLPOptimal I.C I.lam Y) (Δ : Fin m → ℝ)
    (hA_N : ∀ i, i ∉ I.BA Y → (I.Abar *ᵥ I.Ypert Y Δ) i < I.C i - Δ i)
    (hP_N : ∀ q, q ∉ I.BP Y → (I.P *ᵥ I.Ypert Y Δ) q < I.lam q)
    (hy_pos : ∀ j ∈ I.Jy Y, 0 < I.Ypert Y Δ j) :
    I.IsDLPOptimal (I.C - Δ) I.lam (I.Ypert Y Δ) ∧
      ∀ x, I.IsDLPOptimal (I.C - Δ) I.lam x → x = I.Ypert Y Δ := by sorry
end ChoicePAC.MidPoint
Source
Jasin, Kumar, A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice, Math. Oper. Res. 37(2), 2012, App. B.2, p. 333, display 'Y_Δ is the unique optimal solution to DLP[C − Δ, λ]'
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