Two-sided sensitivity bounds from Lagrange multipliers
ProvedVectorSpaceOpt.lagrange_multiplier_sensitivitylagrange-multiplierperturbationsensitivityvalue-function
Consider perturbed constraints and . Let be feasible for , and let dual-positive be complementary and make minimize the shifted Lagrangian over . Then
The hypotheses spell out the source phrase “solutions and corresponding multipliers” without hiding optimality or complementarity in a new structure. This theorem quantifies the multiplier interpretation as a marginal value of constraint relaxation and provides a reusable stability estimate for pairs of conic programs. It remains meaningful for arbitrary vector perturbations, with ordering confined to feasibility and multiplier positivity.
Preamble
import Definitions.Def_VectorSpaceOpt_coneLE import Definitions.Def_VectorSpaceOpt_dualPositive
Formal statement
namespace VectorSpaceOpt
/-- Luenberger, Chapter 8, §8.5, Theorem 1. -/
theorem lagrange_multiplier_sensitivity
{X Z : Type*}
[NormedAddCommGroup Z] [NormedSpace ℝ Z]
(P : ConvexCone ℝ Z) (Ω : Set X) (f : X → ℝ) (G : X → Z)
(z₀ z₁ : Z) (x₀ x₁ : X)
(zstar₀ zstar₁ : Z →L[ℝ] ℝ)
(hx₀ : x₀ ∈ Ω) (hx₁ : x₁ ∈ Ω)
(hfeas₀ : coneLE P (G x₀) z₀)
(hfeas₁ : coneLE P (G x₁) z₁)
(hzstar₀ : dualPositive P zstar₀)
(hzstar₁ : dualPositive P zstar₁)
(hcomp₀ : zstar₀ (G x₀ - z₀) = 0)
(hcomp₁ : zstar₁ (G x₁ - z₁) = 0)
(hmin₀ : ∀ x ∈ Ω,
f x₀ + zstar₀ (G x₀ - z₀) ≤
f x + zstar₀ (G x - z₀))
(hmin₁ : ∀ x ∈ Ω,
f x₁ + zstar₁ (G x₁ - z₁) ≤
f x + zstar₁ (G x - z₁)) :
zstar₁ (z₁ - z₀) ≤ f x₀ - f x₁ ∧
f x₀ - f x₁ ≤ zstar₀ (z₁ - z₀) := by sorry
end VectorSpaceOptSource
David G. Luenberger, Optimization by Vector Space Methods, Wiley, 1969, public scan https://sites.science.oregonstate.edu/~show/old/142_Luenberger.pdf, Chapter 8, §8.5, Theorem 1, printed p. 222; physical PDF p. 242.