Proposition 7.1 — zero-inventory optimal production plan
DisprovedPochetWolsey.Reformulation.zero_inventory_optimalConsider a finite horizon of periods, nonnegative demands , arbitrary real unit production costs , stock costs , and setup costs . Let satisfy . The feasible set consists of real production and nonnegative stocks , binary setups , zero initial and final stocks, and
There is a feasible plan minimizing over all of such that
Thus at least one optimal plan produces only when its entering inventory is zero. Setups without production remain permitted, including when setup costs are negative.
Formalization Note This is the faithful literal reading of the displayed domain (7.4), which prints without a nonnegativity subscript, and defines by those constraints on p. 209. It is expected to be disproved: FINDINGS.yaml records the two-period counterexample and the companion corrected item restores , as in (4.5) and (7.47). The claim is preserved rather than silently repaired. Fin n shifts production indices down by one; stocks retain their boundary indices. “Large” means and .
import Mathlib
namespace PochetWolsey.Reformulation
theorem zero_inventory_optimal
(n : ℕ) (hn : 0 < n) (d p q : Fin n → ℝ) (h : Fin (n + 1) → ℝ)
(hd : ∀ t, 0 ≤ d t) (M : ℝ) (hM : 0 < M) (hlarge : (∑ t, d t) ≤ M) :
let P : Set ((Fin n → ℝ) × (Fin (n + 1) → ℝ) × (Fin n → ℝ)) :=
{z | z.2.1 0 = 0 ∧ z.2.1 (Fin.last n) = 0 ∧
(∀ k, 0 ≤ z.2.1 k) ∧
(∀ t, 0 ≤ z.2.2 t ∧ z.2.2 t ≤ 1 ∧
z.2.1 t.castSucc + z.1 t = d t + z.2.1 t.succ ∧
z.1 t ≤ M * z.2.2 t)}
let X := {z | z ∈ P ∧ ∀ t, z.2.2 t = 0 ∨ z.2.2 t = 1}
let cost := fun z : (Fin n → ℝ) × (Fin (n + 1) → ℝ) × (Fin n → ℝ) =>
(∑ t, p t * z.1 t) + (∑ k, h k * z.2.1 k) + (∑ t, q t * z.2.2 t)
∃ z ∈ X, (∀ z' ∈ X, cost z ≤ cost z') ∧
∀ t, z.2.1 t.castSucc * z.1 t = 0 := by sorry
end PochetWolsey.Reformulation
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Data. Fix a natural number with . Periods are indexed by , and "stock" positions are indexed by . The data are:
- real vectors , , indexed by periods;
- a real vector indexed by ;
- a real number .
The hypotheses are:
- for every ;
- ;
- .
No sign condition is placed on , or .
Points. A point is a triple with (indexed by periods), (indexed by ) and (indexed by periods).
The set . is the set of all such with
and, for every period ,
There is no constraint ; the entries of may be negative as long as the constraints above hold. is the subset of in which every equals or .
Cost. The cost of a point is
Claim. There exists a point with both of the following properties:
- for every , so minimises over ;
- for every period . Here is the stock entry at the same index , the start of period .
The claim asserts the existence of some minimiser with this product property. It does not assert that every minimiser has it.
Degenerate cases.
- The hypotheses involve only the data and are satisfiable.
- The smallest allowed case is . Then , so , and the product condition is automatic.
- At the product condition always holds, because .
- The terms and in the cost are always on .
- Because , , may be negative or zero, the claim is asserted for arbitrary real cost coefficients.
- Because is not required to be nonnegative, the minimisation ranges over points with possibly negative .
- The hypotheses , and constrain the data only. They are not repeated inside , except that appears in .
- If all , the hypotheses remain satisfiable.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.