Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.2, p. 16 — in any optimal solution of (MIP), zj=g~λj(xj+Ij)z_j = \tilde g_{\lambda_j}(x_j + I_j)zj​=g~​λj​​(xj​+Ij​)

Proved
FastFashion.Approx.mip_optimal_z_eq_gTilde

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

approximationinventorymixed-integer-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the program (MIP) (13)–(19) with a finite set of stores JJJ, unit selling prices Pj>0P_j > 0Pj​>0, any warehouse value KKK, warehouse inventory Ws∈NW_s \in \mathbb NWs​∈N, store inventory Isj∈NI_{sj} \in \mathbb NIsj​∈N, rates λsj>0\lambda_{sj} > 0λsj​>0, period T>0T > 0T>0, a nonempty set of major sizes S+\mathcal S^+S+, and nonempty finite tangent index sets N(λsj)⊆N∪{∞}\mathcal N(\lambda_{sj}) \subseteq \mathbb N\cup\{\infty\}N(λsj​)⊆N∪{∞}. Then in every optimal solution (x,z,y,v)(x, z, y, v)(x,z,y,v) of (MIP), for every store jjj,

zj=g~λj(xj+Ij),z_j = \tilde g_{\lambda_j}(x_j + I_j),zj​=g~​λj​​(xj​+Ij​),

where λj=(λsj)s∈S\lambda_j = (\lambda_{sj})_{s\in\mathcal S}λj​=(λsj​)s∈S​, xj+Ij=(xsj+Isj)s∈Sx_j + I_j = (x_{sj} + I_{sj})_{s \in \mathcal S}xj​+Ij​=(xsj​+Isj​)s∈S​, and g~\tilde gg~​ is the approximation (8) with the tangent sets N(λsj)\mathcal N(\lambda_{sj})N(λsj​).

The statement says that the MIP's sales variables represent the approximate expected sales exactly, so that (MIP) maximizes ∑jPjg~λj(xj+Ij)\sum_j P_j \tilde g_{\lambda_j}(x_j + I_j)∑j​Pj​g~​λj​​(xj​+Ij​) plus the warehouse value.

Formalization Note The hypothesis Pj>0P_j > 0Pj​>0 is added: the paper's PjP_jPj​ is a unit selling price, and for Pj=0P_j = 0Pj​=0 the variable zjz_jzj​ is not pushed to its bound. The statement is conditional on optimality; the existence of an optimal solution is not asserted. The claim is deterministic and uses the same g~\tilde gg~​ as the goal theorem.

Preamble
import Mathlib
import Definitions.Def_FastFashion_Approx_Tangents
import Definitions.Def_FastFashion_Approx_MIP
Formal statement
namespace FastFashion.Approx

/-- §3.2 (Caro–Gallien, p. 16): in any optimal solution of (MIP) (13)–(19), the variable `z_j`
equals the approximate expected sales `g̃_{λ_j}(x_j + I_j)` of (8) at store `j`, for every store. -/
theorem mip_optimal_z_eq_gTilde {S J : Type*} [Fintype S] [DecidableEq S] [Fintype J]
    (P : J → ℝ) (hP : ∀ j, 0 < P j) (K : ℝ) (lam : S → J → ℝ) (hlam : ∀ s j, 0 < lam s j)
    (T : ℝ) (hT : 0 < T) (Sp : Finset S) (hSp : Sp.Nonempty)
    (Nset : S → J → Finset (WithTop ℕ)) (hNset : ∀ s j, (Nset s j).Nonempty)
    (W : S → ℕ) (I : S → J → ℕ) (sol : MIPSol S J)
    (hopt : MIPOptimal P K lam T Sp Nset W I sol) :
    ∀ j, sol.z j = gTilde (fun s => lam s j) T Sp hSp (fun s => Nset s j) (fun s => hNset s j)
      (fun s => I s j + sol.x s j) := by sorry

end FastFashion.Approx
Source
Caro & Gallien, Inventory Management of a Fast-Fashion Retail Network, working paper (August 2, 2007), p. 16, §3.2, claim after (MIP); program (13)–(19) on p. 15
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