§8, Proof, p. 151 — there is B > 0 with |c′(α − a)| ≤ B|α − a| for all α, a
ProvedExecCompLP.Consistency.value_lipschitzlinear-functionallipschitzp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let . There exists a constant such that for all ,
This is the displayed step on p. 151: since is a linear functional, the difference of its values at two points is at most times the distance between them. In the proof it bounds how much the objective can change between an extreme point of the true set and the corresponding extreme point of the sample set.
Formalization Note is the maximum norm ; the paper names no norm and the statement is the same for every norm on (with a different ).
Preamble
import Mathlib import Definitions.Def_ExecCompLP_Consistency_Setting
Formal statement
namespace ExecCompLP.Consistency
theorem value_lipschitz {n : ℕ} (c : Fin n → ℝ) :
∃ B > 0, ∀ α a : Fin n → ℝ, |∑ j, c j * (α j - a j)| ≤ B * ‖α - a‖ := by sorry
end ExecCompLP.Consistency
Source
Charnes, Cooper & Ferguson, Optimal estimation of executive compensation by linear programming, Management Science 1(2) (1955), p. 151, §8, Proof, display |c′(α − a)| ≦ B|α − a|
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.