Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§§5–6, pp. 141–143 — ranked least absolute deviations equal a linear program

Proved
ExecCompLP.LAD.lp_equivalence

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

estimationleast-absolute-deviationslinear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

For arbitrary real factor ratings xikx_{ik}xik​, nonnegative-weight salary constraints (2), specified levels KKK, and targets sks_ksk​, compare minimizing D(a)=∑k∈K∣Sk(a)−sk∣D(a)=\sum_{k\in K}|S_k(a)-s_k|D(a)=∑k∈K​∣Sk​(a)−sk​∣ with the transformed linear program minimizing P(u,v)=∑k∈K(uk+vk)P(u,v)=\sum_{k\in K}(u_k+v_k)P(u,v)=∑k∈K​(uk​+vk​) subject to (2), uk,vk≥0u_k,v_k\ge0uk​,vk​≥0, and Sk(a)−sk=uk−vkS_k(a)-s_k=u_k-v_kSk​(a)−sk​=uk​−vk​ for k∈Kk\in Kk∈K. The two problems have the same attainable objective thresholds:

∀t∈R,[∃a feasible:D(a)≤t] ⟺ [∃(a,u,v) LP-feasible:P(u,v)≤t].\forall t\in\mathbb R,\quad [\exists a\text{ feasible}:D(a)\le t]\ \Longleftrightarrow\ [\exists(a,u,v)\text{ LP-feasible}:P(u,v)\le t].∀t∈R,[∃a feasible:D(a)≤t] ⟺ [∃(a,u,v) LP-feasible:P(u,v)≤t].

Moreover, aaa minimizes DDD if and only if (a,w+,w−)(a,w^+,w^-)(a,w+,w−) minimizes PPP, where wk=Sk(a)−skw_k=S_k(a)-s_kwk​=Sk​(a)−sk​; and every LP minimizer (a,u,v)(a,u,v)(a,u,v) projects to a minimizer aaa of DDD.

This states both the agreement of optimal values and the correspondence of optimal solutions claimed in §§5–6.

Formalization Note There is at least one ranked level. No existence of a feasible point or minimizer is assumed; the threshold statement retains meaning when the constraints are infeasible. The LP's split variables are free subject to (4)–(5), including feasible pairs with both entries positive.

Preamble
import Mathlib
import Definitions.Def_ExecCompLP_LAD_Setting
Formal statement
namespace ExecCompLP.LAD

theorem lp_equivalence {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)) ∧
    (∀ a : Fin n → ℝ,
      IsMinimizer x sM sm K s a ↔
      IsLPMinimizer x sM sm K s a
        (fun k => posPart (salary x a k - s k))
        (fun k => negPart (salary x a k - s k))) ∧
    (∀ (a : Fin n → ℝ) (u v : Fin L → ℝ),
      IsLPMinimizer x sM sm K s a u v → IsMinimizer x sM sm K s a) := by sorry

end ExecCompLP.LAD
Source
Charnes, Cooper & Ferguson, Optimal estimation of executive compensation by linear programming, Management Science 1(2) (1955), pp. 141–143, §§5–6, equations (2)–(5) and equivalence claim on p. 143; https://doi.org/10.1287/mnsc.1.2.138
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me