Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

App. D, p. 37 — the affine solution y_{im}(h) = 1 − h_i is feasible and costs m/2 − 1

Proved
BudgetedAffine.NetworkGap.affine_solution

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

affine-policieslot-sizingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization

Consider the family of lot-sizing instances (7.2) with m=2km=2km=2k nodes, k=n+1≥1k=n+1\ge1k=n+1≥1, and let mmm also denote the last node of J2J_2J2​. The affine solution

xi=1  (i=1,…,m−1),xm=0,yij(h)=0  (j∈J2∖{m}),yim(h)=1−hi(i∈J1)x_i=1\ \ (i=1,\dots,m-1),\qquad x_m=0,\qquad y_{ij}(h)=0\ \ (j\in J_2\setminus\{m\}),\qquad y_{im}(h)=1-h_i\qquad(i\in J_1)xi​=1  (i=1,…,m−1),xm​=0,yij​(h)=0  (j∈J2​∖{m}),yim​(h)=1−hi​(i∈J1​)

is feasible for (7.1) on U={h∈[0,1]m:∑ihi≤m/2}\mathcal U=\{h\in[0,1]^m:\sum_ih_i\le m/2\}U={h∈[0,1]m:∑i​hi​≤m/2}, and its cost in every scenario h∈Uh\in\mathcal Uh∈U is

∑i=1mcixi+∑i∈J1∑j∈J2dij yij(h)=m2−1=n.\sum_{i=1}^mc_ix_i+\sum_{i\in J_1}\sum_{j\in J_2}d_{ij}\,y_{ij}(h)=\frac m2-1=n .i=1∑m​ci​xi​+i∈J1​∑​j∈J2​∑​dij​yij​(h)=2m​−1=n.

It shows zAff(U)≤m/2−1z_{Aff}(\mathcal U)\le m/2-1zAff​(U)≤m/2−1, the upper half of the affine value in Lemma 7.1.

Formalization Note The solution is written y(h)=Ph+qy(h)=Ph+qy(h)=Ph+q with the explicit PPP (row of arc (i,m)(i,m)(i,m) equal to −ei-e_i−ei​, all else 000) and qqq (qim=1q_{im}=1qim​=1, all else 000) of the instance definition, for k=n+1k=n+1k=n+1; the paper's node mmm is the last J2J_2J2​ node Sum.inr (Fin.last n). Lean indices are 0-based.

Preamble
import Mathlib
import Definitions.Def_BudgetedAffine_NetworkGap_LotSizing
import Definitions.Def_BudgetedAffine_NetworkGap_Instance
Formal statement
namespace BudgetedAffine.NetworkGap

/-- App. D, p. 37: for `k = n + 1`, the affine solution `x_i = 1` (`i ≠ m`), `x_m = 0`,
`y_{im}(h) = 1 − h_i`, `y_{ij}(h) = 0` (`j ≠ m`) is feasible for the family (7.2) and costs
`m/2 − 1 = n` in every scenario. -/
theorem affine_solution (n : ℕ) :
    (lotSizingFamily (n + 1)).Feasible (ubX n) (LotSizing.affinePolicy (ubP n) (ubQ n)) ∧
      ∀ h ∈ (lotSizingFamily (n + 1)).U,
        (lotSizingFamily (n + 1)).cost (ubX n) (LotSizing.affinePolicy (ubP n) (ubQ n) h)
          = (n : ℝ) := by sorry

end BudgetedAffine.NetworkGap
Source
El Housni, Goyal, On the Optimality of Affine Policies for Budgeted Uncertainty Sets, arXiv:1807.00163v2, App. D, from "Now we consider the following affine solution" to "zAff(U) = m/2 − 1.", p. 37
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

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