Proof of Lemma 2, p. 270 — an affine substitution of the variables preserves the c.p.f. property
ProvedFlexCommitRO.BoxExt.isCPF_comp_affineconvexityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polyhedral-function
Let be a convex polyhedral function, and . Then
is a convex polyhedral function on .
In the proof of Lemma 2 this makes a c.p.f. in each argument.
Preamble
import Mathlib import Definitions.Def_FlexCommitRO_BoxExt_WorstCaseDP open Matrix
Formal statement
namespace FlexCommitRO.BoxExt
theorem isCPF_comp_affine {m k : ℕ} (g : (Fin k → ℝ) → EReal) (hg : IsCPF g)
(M : Matrix (Fin k) (Fin m) ℝ) (v : Fin k → ℝ) :
IsCPF (fun s : Fin m → ℝ => g (M *ᵥ s + v)) := 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. 270, Appendix, proof of Lemma 2 ("an affine transformation of the variables … retain its c.p.f. property")
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.