The perturbation value decreases when constraints are relaxed
ProvedVectorSpaceOpt.perturbationValue_antitoneantitonecone-orderperturbationvalue-function
Let be the extended-real optimal value under . If , so that the right-hand side relaxes the constraint at , then
The statement requires no convexity because it follows from the nesting of the two feasible sets, and its EReal inequality remains meaningful when either problem is infeasible or unbounded below. This is Luenberger's monotonicity proposition with the cone-order orientation made explicit. It is a reusable order-theoretic fact for perturbation bounds and checks the sign conventions shared by the later sensitivity and duality items. It also covers empty feasible sets without a separate case split.
Preamble
import Definitions.Def_VectorSpaceOpt_perturbationValue
Formal statement
namespace VectorSpaceOpt
/-- Luenberger, Chapter 8, §8.3, Proposition 2. -/
theorem perturbationValue_antitone
{X Z : Type*}
[AddCommGroup Z] [Module ℝ Z]
(P : ConvexCone ℝ Z) (Ω : Set X) (f : X → ℝ) (G : X → Z)
(z₀ z₁ : Z) (hz : coneLE P z₀ z₁) :
perturbationValue P Ω f G z₁ ≤ perturbationValue P Ω f G 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.3, Proposition 2, printed p. 217; physical PDF p. 237.