§4, last paragraph — (8.0) is redundant: Σxᵢⱼ = 1 and (8.1)–(8.T) imply (8.0)
ProvedManneLP.Equilibrium.eq_8_0_redundantlinear-programmingmarkov-chainsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Consider Manne's inventory model with admissible pairs (so for every ) and demand law , . Let be real numbers with
that satisfy the equations (8.t), , for . Then also satisfies (8.0):
This is why the linear program's constraint set consists of the non-negativity conditions, (4) and (8.1)–(8.T) only.
Formalization Note Non-negativity of is not assumed; the statement is the stronger one, and the paper's claim is its special case.
Preamble
import Mathlib import Definitions.Def_ManneLP_Equilibrium_Model import Definitions.Def_ManneLP_Equilibrium_LP
Formal statement
namespace ManneLP.Equilibrium
theorem eq_8_0_redundant (M : Model) (x : ℕ × ℕ → ℝ)
(h4 : ∑ a ∈ M.A, x a = 1) (h8 : ∀ t : ℕ, 1 ≤ t → t ≤ M.T → Eq8t M x t) :
Eq80 M x := by sorry
end ManneLP.Equilibrium
Source
Manne, Linear Programming and Sequential Decisions, Management Science 6 (1960), p. 262 (PDF p. 5), §4, last paragraph
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.