§6, p. 143 — projection of a split-variable feasible point
ProvedExecCompLP.LAD.project_feasibleleast-absolute-deviationslinear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let satisfy the ranked salary constraints (2) and the transformed constraints and for each . The projected weight vector is feasible for the original problem, and
Thus every point of the transformed problem has an associated point of the original problem whose objective is no larger.
Preamble
import Mathlib import Definitions.Def_ExecCompLP_LAD_Setting
Formal statement
namespace ExecCompLP.LAD
theorem project_feasible {n L : ℕ} [NeZero L]
(x : Fin n → Fin L → ℝ) (sM sm : ℝ) (K : Finset (Fin L))
(s : Fin L → ℝ) (a : Fin n → ℝ) (u v : Fin L → ℝ)
(h : LPFeasible x sM sm K s a u v) :
Feasible x sM sm a ∧ obj x K s a ≤ lpObj K u v := 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.