Feasible for LP(Ā) implies feasible for (Ib)
ProvedSoysterInexactLP.Auxiliary.feasibleIb_of_feasibleLPlinear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization
Let be nonempty convex sets with for all , let and let have entries . If satisfies
then is feasible for (Ib): .
This is the first half of the THEOREM.
Formalization Note Convexity is a standing assumption and unused.
Preamble
import Mathlib import Definitions.Def_SoysterInexactLP_Auxiliary_Problems open Pointwise Matrix
Formal statement
namespace SoysterInexactLP.Auxiliary
theorem feasibleIb_of_feasibleLP {m n : ℕ} (K : Fin n → Set (Fin m → ℝ))
(hne : ∀ j, (K j).Nonempty) (hconv : ∀ j, Convex ℝ (K j))
(hfin : ∀ i j, supportFun (K j) (Pi.single i 1) < ⊤) (b : Fin m → ℝ)
(x : Fin n → ℝ) (hx : FeasibleLP (Abar K) b x) :
FeasibleIb K b 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), proof of THEOREM, first paragraph
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.