The domain of the cost function, p. 868, and Appendix, p. 872 — D is convex and compact
ProvedSimpsonInv.Vertex.dom_convex_compactcompactnessconvexityinventoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polyhedron
Let , let and be real constants, and let be the domain of Simpson's cost function:
Then is a convex set and a compact subset of .
Convexity is the paper's "convex polyhedron" (an intersection of half-spaces), and compactness is what the Appendix uses to conclude that the cost function attains its minimum on .
Formalization Note No hypothesis on the constants is needed: the empty set is convex and compact. is Fin m → ℝ with its product (Euclidean) topology; Lean index is the paper's .
Preamble
import Mathlib import Definitions.Def_SimpsonInv_Vertex_Setting
Formal statement
namespace SimpsonInv.Vertex
theorem dom_convex_compact {m : ℕ} (T : ℕ → ℝ) (S0 Sn : ℝ) :
Convex ℝ (dom (m := m) T S0 Sn) ∧ IsCompact (dom (m := m) T S0 Sn) := by sorry
end SimpsonInv.Vertex
Source
Simpson, In-Process Inventories, Operations Research 6 (1958), p. 868, The domain of the cost function; p. 872, Appendix. Proof of Theorem I
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.