Feasible for (Ib) implies x₁ sup aᵢ₁ + ⋯ + xₙ sup aᵢₙ ≦ bᵢ, i.e. feasible for LP(Ā)
ProvedSoysterInexactLP.Auxiliary.feasibleLP_of_feasibleIblinear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimizationsupport-function
Let be nonempty convex sets with for all , and let . If is feasible for (Ib), then for every
and consequently is feasible for LP: and .
This is the second half of the THEOREM.
Formalization Note The suprema are converted to real numbers, exact under the nonemptiness and finiteness hypotheses. 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 feasibleLP_of_feasibleIb {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 : FeasibleIb K b x) :
(∀ i, ∑ j, x j * (supportFun (K j) (Pi.single i 1)).toReal ≤ b i) ∧
FeasibleLP (Abar 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, second paragraph
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.