An infinite support functional δ*(eᵢ|Kⱼ) = ∞ forces xⱼ = 0 in (Ib)
ProvedSoysterInexactLP.Auxiliary.eq_zero_of_support_eq_toplinear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1support-function
Let be nonempty convex sets and . Suppose is feasible for (Ib), i.e. and . If for some row and column
then .
This justifies deleting from (Ib) every activity set whose support functional is infinite in some coordinate direction, so that the auxiliary linear program can be formed with finite entries.
Formalization Note Nonemptiness of all the is needed (with an empty the Minkowski sum is empty and every is feasible); convexity is the paper's standing assumption and is not needed.
Preamble
import Mathlib import Definitions.Def_SoysterInexactLP_Auxiliary_Problems open Pointwise Matrix
Formal statement
namespace SoysterInexactLP.Auxiliary
theorem eq_zero_of_support_eq_top {m n : ℕ} (K : Fin n → Set (Fin m → ℝ))
(hne : ∀ j, (K j).Nonempty) (hconv : ∀ j, Convex ℝ (K j)) (b : Fin m → ℝ)
(x : Fin n → ℝ) (hx : FeasibleIb K b x) (i : Fin m) (j : Fin n)
(htop : supportFun (K j) (Pi.single i 1) = ⊤) :
x j = 0 := 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), paragraph defining āⱼ
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.