Compact activity sets have finite support functionals δ*(eᵢ|Kⱼ) < ∞
ProvedSoysterInexactLP.Auxiliary.support_lt_top_of_compactconvex-setsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1support-function
Let be nonempty convex sets. If every is compact, then
So the finiteness assumption under which the auxiliary linear program LP is defined holds automatically for compact activity sets, for instance for the hyperspheres of the inexact linear programming application.
Formalization Note Nonemptiness and convexity are the paper's standing assumptions and are kept although unused.
Preamble
import Mathlib import Definitions.Def_SoysterInexactLP_Auxiliary_Problems open Pointwise Matrix
Formal statement
namespace SoysterInexactLP.Auxiliary
theorem support_lt_top_of_compact {m n : ℕ} (K : Fin n → Set (Fin m → ℝ))
(hne : ∀ j, (K j).Nonempty) (hconv : ∀ j, Convex ℝ (K j))
(hcpt : ∀ j, IsCompact (K j)) :
∀ i j, supportFun (K j) (Pi.single i 1) < ⊤ := by sorry
end SoysterInexactLP.Auxiliary
Source
Soyster, Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming, Operations Research 21 (1973), p. 1156 (PDF p. 4), first paragraph
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.