For convex problems the Slater condition RC 1 implies RC 0
ProvedKallMayerSLP.KKT.rc1_implies_rc0convex-optimizationkkt-conditionsnonlinear-programmingp2o-gran-per-chapterp2o-plan-bookp2o-v1stochastic-linear-programming
Throughout, and are convex and continuously differentiable, the book's standing assumptions for the program
with feasible set .
If (3.1) satisfies the Slater condition RC 1 (a feasible with for all ), then it satisfies the regularity condition RC 0.
This is the step that makes Proposition 3.4 a consequence of the Farkas lemma.
Differences from the source:
- encoding: ℝⁿ with zᵀv → EuclideanSpace ℝ (Fin n) with the inner product ⟪z, v⟫ and Mathlib's gradient; reason: Lean convention; the same space and the same gradient for differentiable functions
Preamble
import Mathlib import Definitions.Def_KallMayerSLP_KKT_RC0 import Definitions.Def_KallMayerSLP_KKT_RC1
Formal statement
namespace KallMayerSLP.KKT
/-- **For convex problems, `RC 1` (Slater) implies `RC 0`.**
Kall & Mayer, *Stochastic Linear Programming* (2005), Chapter 1, §3, p.63 (PDF 74): "Without proof we mention that, for convex problems, `RC 1` implies
`RC 0`."
Here `f` and every `gᵢ` are convex on `ℝⁿ` and continuously differentiable (`ContDiff ℝ 1`), the
book's standing assumptions for (3.1) (p.61 and p.62). -/
theorem rc1_implies_rc0 {n m : ℕ} (f : EuclideanSpace ℝ (Fin n) → ℝ) (g : Fin m → EuclideanSpace ℝ (Fin n) → ℝ)
(hf : ConvexOn ℝ Set.univ f) (hg : ∀ i, ConvexOn ℝ Set.univ (g i))
(hf1 : ContDiff ℝ 1 f) (hg1 : ∀ i, ContDiff ℝ 1 (g i)) (hS : RC1 g) :
RC0 f g := by sorry
end KallMayerSLP.KKT
Source
Kall & Mayer, Stochastic Linear Programming: Models, Theory, and Computation (Kluwer/Springer 2005), Chapter 1, §3, p.63 (PDF 74)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.