Proof of Proposition 1, p. 271 — the R-box step, corrected: value(box) ≤ value_R(box) for all R, value(ext) ≤ value(box), value(ext) = inf_R value_R(ext)
ProvedFlexCommitRO.BoxExt.value_sandwichmin-maxp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimizationsupply-chain
Let an instance of the RSFC model be given, together with demand bounds , . Write and , for the optimal value of the min-max RSFC problem (5)–(6) and for the same problem with every decision bounded by in absolute value. Then:
- for every ;
- ;
Together with the boxed equality, these give .
Formalization Note The page argues that "for an large enough this restriction does not affect the optimal value". As printed this is false when the optimal value is , which the paper's sign-free data allow (e.g. , , , , : then is unbounded below while every boxed value is finite). The statement is the corrected form, which holds for all data and is what the argument needs.
Preamble
import Mathlib import Definitions.Def_FlexCommitRO_BoxExt_Setting
Formal statement
namespace FlexCommitRO.BoxExt
theorem value_sandwich {T : ℕ} (D : RSFCData T) (dmin dmax : Fin T → ℝ)
(hle : ∀ t, dmin t ≤ dmax t) :
(∀ R : ℝ, value D (fun t => Set.Icc (dmin t) (dmax t)) ≤
valueR D (fun t => Set.Icc (dmin t) (dmax t)) R) ∧
value D (fun t => ({dmin t, dmax t} : Set ℝ)) ≤ value D (fun t => Set.Icc (dmin t) (dmax t)) ∧
value D (fun t => ({dmin t, dmax t} : Set ℝ)) =
⨅ R : ℝ, valueR D (fun t => ({dmin t, dmax t} : Set ℝ)) R := 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. 271, Appendix, proof of Proposition 1 (continued), "for an R large enough this restriction does not affect the optimal value"
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.