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
ProvedFlexCommitRO.BoxExt.proposition_1Consider the min-max retailer–supplier flexible commitments problem (5)–(6) over periods, with arbitrary real costs, penalties, salvage value, initial inventory and previous commitment, and order and cumulative-order bounds in . Let the demand uncertainty be the box (9)–(10),
Let be problem (5) over and the same problem over the finite set of its extreme points , with decision rules nonanticipative on the respective uncertainty set. Then the optimal values agree:
This is what makes the box case of the min-max RSFC problem directly solvable: only the extreme demand trajectories need to be considered (§2.3, problem ).
Formalization Note Optimal values are extended reals ( if infeasible, possibly ). Lean periods are 0-based (Fin T). is written as the pair , justified by the milestone on extreme points of a segment. Decision rules depend on and on , as in (5)–(6). The standing assumptions and of §2.2 are not imposed (Proposition 1 does not use them), and no sign is assumed on any cost or penalty.
import Mathlib import Definitions.Def_FlexCommitRO_BoxExt_Setting
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.