§6, p. 143 — the two problems have equal minimal values
ProvedExecCompLP.LAD.minimal_values_eqleast-absolute-deviationslinear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be the feasible weight vectors specified by (2), and let be the feasible triples specified by (2), (4), and (5). For every real threshold ,
where and . Consequently the two problems have the same attainable objective thresholds and, whenever a minimum is attained, the same minimum value.
Formalization Note Threshold equivalence also covers an empty feasible set without assigning a default real value to its infimum.
Preamble
import Mathlib import Definitions.Def_ExecCompLP_LAD_Setting
Formal statement
namespace ExecCompLP.LAD
theorem minimal_values_eq {n L : ℕ} [NeZero L]
(x : Fin n → Fin L → ℝ) (sM sm : ℝ) (K : Finset (Fin L))
(s : Fin L → ℝ) :
∀ t : ℝ,
(∃ a : Fin n → ℝ, Feasible x sM sm a ∧ obj x K s a ≤ t) ↔
(∃ (a : Fin n → ℝ) (u v : Fin L → ℝ),
LPFeasible x sM sm K s a u v ∧ lpObj K u v ≤ t) := by sorry
end ExecCompLP.LAD
Source
Charnes, Cooper & Ferguson, Optimal estimation of executive compensation by linear programming, Management Science 1(2) (1955), p. 143, §6, first full paragraph; https://doi.org/10.1287/mnsc.1.2.138
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.