§4, (6)–(7) — the law of the terminal stock in terms of the joint probabilities xᵢⱼ
ProvedManneLP.Equilibrium.terminal_law_eq_7inventorymarkov-chainsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Consider Manne's inventory model with stock levels , admissible pairs and demand law . Let be any assignment of production probabilities and any weights on the initial stock, and put . If the chain of moves from to with probability , then the law of the terminal stock is given by (7):
This identifies the right-hand sides of the equilibrium equations (8.0)–(8.T) with the one-step law of the controlled Markov chain, which is the link between the decision problem and the linear program.
Formalization Note The identity holds for every and , with no normalization, and is stated that way. Sums over run over the admissible pairs; sums over are tsums.
Preamble
import Mathlib import Definitions.Def_ManneLP_Equilibrium_Model import Definitions.Def_ManneLP_Equilibrium_Chain import Definitions.Def_ManneLP_Equilibrium_LP
Formal statement
namespace ManneLP.Equilibrium
theorem terminal_law_eq_7 (M : Model) (q : ℕ → ℕ → ℝ) (y : ℕ → ℝ) :
∑ i ∈ states M, y i * trans M q i 0 = rhsZero M (jointLaw y q) ∧
∀ t : ℕ, 1 ≤ t → t ≤ M.T →
∑ i ∈ states M, y i * trans M q i t = rhsPos M (jointLaw y q) t := by sorry
end ManneLP.Equilibrium
Source
Manne, Linear Programming and Sequential Decisions, Management Science 6 (1960), pp. 261–262 (PDF pp. 4–5), §4, (6) and (7)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.