Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1, p. 269 — the min-max RSFC problem over the demand box and over its 2^T extreme trajectories have the same optimal value

Proved
FlexCommitRO.BoxExt.proposition_1

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

extreme-pointsmin-maxp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimizationsupply-chain

Consider the min-max retailer–supplier flexible commitments problem (5)–(6) over TTT periods, with arbitrary real costs, penalties, salvage value, initial inventory and previous commitment, and order and cumulative-order bounds in [−∞,+∞][-\infty, +\infty][−∞,+∞]. Let the demand uncertainty be the box (9)–(10),

Ubox=[d1min⁡,d1max⁡]×⋯×[dTmin⁡,dTmax⁡],dtmin⁡<dtmax⁡.\mathcal U_{\text{box}} = [d_1^{\min}, d_1^{\max}] \times \dots \times [d_T^{\min}, d_T^{\max}],\qquad d_t^{\min} < d_t^{\max}.Ubox​=[d1min​,d1max​]×⋯×[dTmin​,dTmax​],dtmin​<dtmax​.

Let (P)(P)(P) be problem (5) over Ubox\mathcal U_{\text{box}}Ubox​ and (P+)(P_+)(P+​) the same problem over the finite set of its extreme points ext⁡(Ubox)={d1min⁡,d1max⁡}×⋯×{dTmin⁡,dTmax⁡}\operatorname{ext}(\mathcal U_{\text{box}}) = \{d_1^{\min}, d_1^{\max}\} \times \dots \times \{d_T^{\min}, d_T^{\max}\}ext(Ubox​)={d1min​,d1max​}×⋯×{dTmin​,dTmax​}, with decision rules nonanticipative on the respective uncertainty set. Then the optimal values agree:

opt⁡(P)=opt⁡(P+).\operatorname{opt}(P) = \operatorname{opt}(P_+).opt(P)=opt(P+​).

This is what makes the box case of the min-max RSFC problem directly solvable: only the 2T2^T2T extreme demand trajectories need to be considered (§2.3, problem PextP_{\text{ext}}Pext​).

Formalization Note Optimal values are extended reals (+∞+\infty+∞ if infeasible, possibly −∞-\infty−∞). Lean periods are 0-based (Fin T). ext⁡(Ut)\operatorname{ext}(\mathcal U_t)ext(Ut​) is written as the pair {dtmin⁡,dtmax⁡}\{d_t^{\min}, d_t^{\max}\}{dtmin​,dtmax​}, justified by the milestone on extreme points of a segment. Decision rules qt,yt,utq_t, y_t, u_tqt​,yt​,ut​ depend on dt−1d^{t-1}dt−1 and xt+1x_{t+1}xt+1​ on dtd^tdt, as in (5)–(6). The standing assumptions s<cTs < c_Ts<cT​ and hT−s≥−pTh_T - s \ge -p_ThT​−s≥−pT​ of §2.2 are not imposed (Proposition 1 does not use them), and no sign is assumed on any cost or penalty.

Preamble
import Mathlib
import Definitions.Def_FlexCommitRO_BoxExt_Setting
Formal statement
namespace FlexCommitRO.BoxExt

theorem proposition_1 {T : ℕ} (D : RSFCData T) (dmin dmax : Fin T → ℝ)
    (hlt : ∀ t, dmin t < dmax t) :
    value D (fun t => Set.Icc (dmin t) (dmax t)) =
      value D (fun t => ({dmin t, dmax t} : Set ℝ)) := by sorry

end FlexCommitRO.BoxExt
Source
Ben-Tal, Golany, Nemirovski & Vial, Retailer-supplier flexible commitments contracts: a robust optimization approach, MSOM 7(3) (2005), p. 269, Appendix, Proposition 1; problem (5)–(6) p. 254; box (9)–(10) p. 255
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