LEMMA — the feasible set X of (I) is convex
ProvedSoysterInexactLP.Auxiliary.lemma_X_convexconvex-setslinear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be nonempty convex activity sets and a nonempty convex resource set. Then the feasible set of problem (I),
is a convex subset of .
Together with the linear objective, this makes (I) a convex program.
Formalization Note All four standing assumptions of p. 1154 are hypotheses; only the convexity of is needed.
Preamble
import Mathlib import Definitions.Def_SoysterInexactLP_Auxiliary_Problems open Pointwise Matrix
Formal statement
namespace SoysterInexactLP.Auxiliary
theorem lemma_X_convex {m n : ℕ} (K : Fin n → Set (Fin m → ℝ))
(R : Set (Fin m → ℝ)) (hne : ∀ j, (K j).Nonempty) (hconv : ∀ j, Convex ℝ (K j))
(hRne : R.Nonempty) (hRconv : Convex ℝ R) :
Convex ℝ (X K R) := by sorry
end SoysterInexactLP.Auxiliary
Source
Soyster, Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming, Operations Research 21 (1973), p. 1155 (PDF p. 3), LEMMA
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.