Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5, p. 141 — every feasible deviation has nonnegative split variables

Proved
ExecCompLP.LAD.lift_feasible

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

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

Let aaa satisfy the nonnegative-weight, ceiling, ranking, and floor constraints (2). For each specified level k∈Kk\in Kk∈K, set wk=Sk(a)−skw_k=S_k(a)-s_kwk​=Sk​(a)−sk​, uk=max⁡(wk,0)u_k=\max(w_k,0)uk​=max(wk​,0), and vk=max⁡(−wk,0)v_k=\max(-w_k,0)vk​=max(−wk​,0). Then (a,u,v)(a,u,v)(a,u,v) satisfies the transformed constraints (4)–(5), and

∑k∈K(uk+vk)=∑k∈K∣Sk(a)−sk∣.\sum_{k\in K}(u_k+v_k)=\sum_{k\in K}|S_k(a)-s_k|.k∈K∑​(uk​+vk​)=k∈K∑​∣Sk​(a)−sk​∣.

This identifies an LP-feasible point with the same objective for every feasible choice of salary weights.

Formalization Note The split variables are functions on all ranked levels, but their signs and defining equations are required only at the specified levels KKK, as in the paper.

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

theorem lift_feasible {n L : ℕ} [NeZero L]
    (x : Fin n → Fin L → ℝ) (sM sm : ℝ) (K : Finset (Fin L))
    (s : Fin L → ℝ) (a : Fin n → ℝ) (ha : Feasible x sM sm a) :
    LPFeasible x sM sm K s a
      (fun k => posPart (salary x a k - s k))
      (fun k => negPart (salary x a k - s k)) ∧
    lpObj K
      (fun k => posPart (salary x a k - s k))
      (fun k => negPart (salary x a k - s k)) = obj x 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), p. 141, §5, equations (4)–(5) and sentence following (5); 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