Eq. (10.11) — start-up stock inequality
ProvedPochetWolsey.BacklogStartup.startup_stock_inequalityLet be demands and a sufficiently large production bound. Suppose , the binary setup/start-up plan satisfies (10.5)–(10.8), and , in every period. Then for ,
This is the interval stock inequality (10.11), a component of the Wagner–Whitin start-up hull description.
Formalization Note Initial stock is a nonnegative variable, the initial setup state is given, and there is no fixed terminal stock. The bound explicitly realizes the uncapacitated big- convention; the inequality does not rely on a special demand instance.
Initial-state convention: the parameter y0 is the same fixed binary datum in every feasible set in this item (printed p. 138 / PDF 155); it is not optimized.
import Mathlib import Definitions.Def_PochetWolsey_BacklogStartup_StartupModel
namespace PochetWolsey.BacklogStartup
theorem startup_stock_inequality {n : ℕ} (y0 : ℝ) (hy0 : y0 = 0 ∨ y0 = 1) (d : Fin n → ℝ) (hd : ∀ t, 0 ≤ d t)
(M : ℝ) (hM : demandSum d 1 n ≤ M) (p : StartupPoint n) (x : Fin n → ℝ)
(hp : LSStartup y0 d M p x) (k l : ℕ) (hk : 1 ≤ k) (hkl : k ≤ l) (hl : l ≤ n) :
startupStockRHS d p k l ≤ stock p.1 (k - 1) := by sorry
end PochetWolsey.BacklogStartup
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting. Let:
- ;
- be a real number;
- with every coordinate ;
- be a real number with .
Let with:
- , coordinates ;
- , coordinates indexed .
Let . Write:
- for , and otherwise;
- and for .
Hypotheses on . Assume:
- for , with otherwise free;
- ;
- every and every lies in ;
- for every :
Claim. For all with :
The inner sum is empty, hence , when .
Degenerate cases.
- If , no admissible exist and the statement is vacuous.
- When , the claim reads .
- If all demands are , then is the only constraint on , and the claim reads .
- If is allowed (when all demands are ), production is forced to .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.