Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

App. D, p. 35 — stocking J₁ fully gives an adjustable solution of cost 0

Proved
BudgetedAffine.NetworkGap.adjustable_cost_zero

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

adjustable-robustlot-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, bipartition (J1,J2)(J_1,J_2)(J1​,J2​), ∣J1∣=∣J2∣=k|J_1|=|J_2|=k∣J1​∣=∣J2​∣=k, budget uncertainty set U={h∈[0,1]m:∑ihi≤m/2}\mathcal U=\{h\in[0,1]^m:\sum_i h_i\le m/2\}U={h∈[0,1]m:∑i​hi​≤m/2}, inventory costs c=0c=0c=0 on J1J_1J1​ and c=1c=1c=1 on J2J_2J2​, unit capacities, and zero-cost shipping from J1J_1J1​ to J2J_2J2​. Let the first-stage inventory be

xi={1i∈J10i∈J2.x_i=\begin{cases}1 & i\in J_1\\ 0 & i\in J_2.\end{cases}xi​={10​i∈J1​i∈J2​.​

Then there is a second-stage policy y:U→R+J1×J2y:\mathcal U\to\mathbb R_+^{J_1\times J_2}y:U→R+J1​×J2​​ such that (x,y)(x,y)(x,y) is feasible for (7.1) and, for every h∈Uh\in\mathcal Uh∈U,

∑i=1mcixi+∑i∈J1∑j∈J2dij yij(h)=0.\sum_{i=1}^m c_ix_i+\sum_{i\in J_1}\sum_{j\in J_2}d_{ij}\,y_{ij}(h)=0 .i=1∑m​ci​xi​+i∈J1​∑​j∈J2​∑​dij​yij​(h)=0.

Since every cost is non-negative, this shows zAR(U)=0z_{AR}(\mathcal U)=0zAR​(U)=0: the fully adjustable problem has optimal value zero on the whole family.

Formalization Note The paper constructs y(h)y(h)y(h) (a matching from J1∖J~1(h)J_1\setminus\tilde J_1(h)J1​∖J~1​(h) to J~2(h)\tilde J_2(h)J~2​(h)) only for scenarios hhh that are extreme points of U\mathcal UU. Feasibility requires every h∈Uh\in\mathcal Uh∈U, and the statement quantifies over all of U\mathcal UU; it remains true, since for fixed xxx the constraints are linear in (h,y)(h,y)(h,y). Lean indices are 0-based; shipping is restricted to the arcs J1×J2J_1\times J_2J1​×J2​, the only arcs of finite distance.

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

/-- App. D, p. 35: with `x = 1` on `J₁` and `x = 0` on `J₂` there is a second-stage policy
`y` such that `(x, y)` is feasible for the family (7.2) and costs `0` in every scenario. -/
theorem adjustable_cost_zero (k : ℕ) :
    ∃ y : (Node k → ℝ) → Arc k → ℝ,
      (lotSizingFamily k).Feasible (Sum.elim (fun _ => 1) (fun _ => 0)) y ∧
      ∀ h ∈ (lotSizingFamily k).U,
        (lotSizingFamily k).cost (Sum.elim (fun _ => 1) (fun _ => 0)) (y h) = 0 := by sorry

end BudgetedAffine.NetworkGap
Source
El Housni, Goyal, On the Optimality of Affine Policies for Budgeted Uncertainty Sets, arXiv:1807.00163v2, App. D, proof of Lemma 7.1, first paragraph ("First let us show that zAR = 0" to "Therefore, zAR(U) = 0."), p. 35
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