Feasibility for (I) means x₁a₁+⋯+xₙaₙ ∈ K for every choice aⱼ ∈ Kⱼ
ProvedSoysterInexactLP.Auxiliary.feasibleI_iff_forall_choiceconvex-setslinear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be nonempty convex activity sets and a nonempty convex resource set. A vector is feasible for problem (I), i.e. and , if and only if and
This unpacks the Minkowski-sum constraint into the "for every realisation of the activity vectors" form used in the rest of the paper.
Formalization Note Nonemptiness and convexity of the sets are the paper's standing assumptions (p. 1154) and are kept as hypotheses, although the equivalence holds for arbitrary sets.
Preamble
import Mathlib import Definitions.Def_SoysterInexactLP_Auxiliary_Problems open Pointwise Matrix
Formal statement
namespace SoysterInexactLP.Auxiliary
theorem feasibleI_iff_forall_choice {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) (x : Fin n → ℝ) :
FeasibleI K R x ↔
(∀ j, 0 ≤ x j) ∧ ∀ a : Fin n → Fin m → ℝ, (∀ j, a j ∈ K j) → ∑ j, x j • a j ∈ 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. 1154 (PDF p. 2), sentence after (I)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.