Appendix, p. 16 — under B and C each (P_i[x]) is strictly feasible and bounded below
ProvedRobustUncLP.Ellipsoidal.P_strictly_feasible_bddBelowellipsoidal-uncertaintyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimizationslater-condition
Let satisfy condition B ( bounded) and condition C (some equals with for every ). Then:
- the problems are strictly feasible: there is with and for all ;
- for every and every row , the objective is bounded below on the feasible set of .
These are exactly the hypotheses under which (II) applies to .
Formalization Note Boundedness of is a uniform bound on all matrix entries (UncBounded). Condition C is read for every (see the Setting definition).
Preamble
import Mathlib import Definitions.Def_RobustUncLP_Ellipsoidal_Setting import Definitions.Def_RobustUncLP_Ellipsoidal_SystemC
Formal statement
namespace RobustUncLP.Ellipsoidal
open Matrix EllipsoidalData
/-- Appendix, p. 16: under conditions B and C, every problem `(P_i[x])` is strictly feasible and
its objective is bounded below on its feasible set. -/
theorem P_strictly_feasible_bddBelow {m n k : ℕ} (D : EllipsoidalData m n k)
(hB : UncBounded D.uncSet) (hC : D.SlaterC) :
(∃ u ∈ PFeas D, ∀ ℓ, euclidNorm (D.Q ℓ *ᵥ u ℓ) < 1) ∧
∀ (x : Fin n → ℝ) (i : Fin m),
BddBelow ((fun u => (D.Pi 0 (u 0) *ᵥ x) i) '' PFeas D) := by sorry
end RobustUncLP.Ellipsoidal
Source
Ben-Tal & Nemirovski, Robust solutions of uncertain linear programs, Oper. Res. Lett. 25 (1999); authors' manuscript, Appendix, p. 16, first sentence
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.