Convexity of the optimal cost in the right-hand side
ProvedLinearOptimization.lp_optimal_cost_convex_in_rhsconvexitylinear-programmingsensitivity
(Theorem 5.1, p. 213) The optimal cost is a convex function of on the set .
(Standing hypotheses in force, made explicit: standard form with the rows of linearly independent, and the dual feasible set nonempty — so that is finite for every .)
Preamble
import Mathlib.Analysis.Convex.Function import Mathlib.LinearAlgebra.LinearIndependent.Defs import Definitions.Def_LinearOptimization_OptimalCostFunction open Matrix /-- **Bertsimas & Tsitsiklis, Theorem 5.1 (p. 213).** The optimal cost `F(b)` of the standard form problem `min c'x, Ax = b, x ≥ 0` (rows of `A` linearly independent, dual feasible set nonempty) is a convex function of `b` on the set `S` of feasible right-hand sides. -/
Formal statement
theorem LinearOptimization.lp_optimal_cost_convex_in_rhs {m n : ℕ}
(A : Matrix (Fin m) (Fin n) ℝ) (c : Fin n → ℝ) (F : (Fin m → ℝ) → ℝ)
(hrank : LinearIndependent ℝ (fun i => A i))
(hdual : (dualFeasibleStd A c).Nonempty)
(hF : ∀ b ∈ feasibleRhsSet A, ((F b : ℝ) : EReal) = lpOptimalCostRhs A c b) :
ConvexOn ℝ (feasibleRhsSet A) F := by
sorry
Source
Bertsimas & Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997, Theorem 5.1, p. 213 (standing assumptions pp. 202, 212)