x is feasible for (Ib) iff A·x ≦ b for all A ∈ M and x ≧ 0
ProvedSoysterInexactLP.Auxiliary.feasibleIb_iff_forall_mem_Mlinear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization
Let be nonempty convex sets, , and let be the set of matrices with for every . Then is feasible for (Ib) if and only if
This is the matrix form of the set-inclusive constraint of (Ib), from which the auxiliary linear program is derived.
Formalization Note Nonemptiness and convexity are the paper's standing assumptions and are kept although the equivalence does not need them.
Preamble
import Mathlib import Definitions.Def_SoysterInexactLP_Auxiliary_Problems open Pointwise Matrix
Formal statement
namespace SoysterInexactLP.Auxiliary
theorem feasibleIb_iff_forall_mem_M {m n : ℕ} (K : Fin n → Set (Fin m → ℝ))
(hne : ∀ j, (K j).Nonempty) (hconv : ∀ j, Convex ℝ (K j)) (b : Fin m → ℝ)
(x : Fin n → ℝ) :
FeasibleIb K b x ↔ (∀ A ∈ MSet K, A *ᵥ x ≤ b) ∧ 0 ≤ x := 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), sentence after the definition of M
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.