Appendix, p. 872 — f is continuous and D compact, so f achieves its minimum on D
ProvedSimpsonInv.Vertex.exists_isMinOncompactnessexistence-of-minimuminventoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let , let and () be real constants, and suppose the domain (all and all radicands ) is nonempty. Then the cost function
attains its minimum on : there is with for every .
This is the first step of the Appendix's proof of THEOREM I; the rest of the proof locates the minimizer.
Formalization Note The nonemptiness of is added: "the function does achieve its minimum" presupposes it. No sign condition on is needed. Lean index of Fin m → ℝ is the paper's .
Preamble
import Mathlib import Definitions.Def_SimpsonInv_Vertex_Setting
Formal statement
namespace SimpsonInv.Vertex
theorem exists_isMinOn {m : ℕ} (c S0 Sn : ℝ) (r T : ℕ → ℝ)
(hD : (dom (m := m) T S0 Sn).Nonempty) :
∃ v ∈ dom (m := m) T S0 Sn, IsMinOn (cost c r T S0 Sn) (dom (m := m) T S0 Sn) v := by sorry
end SimpsonInv.Vertex
Source
Simpson, In-Process Inventories, Operations Research 6 (1958), p. 872, Appendix. Proof of Theorem I (opening paragraph)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.