Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6, Table 1 — the example's shortage costs (4, 2, 2, 0, 0, 0, 0) and cost coefficients cᵢⱼ = (4, 5, 3, 4, 2, 5, 3)

Proved
ManneLP.Equilibrium.table1_cost_coefficients

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

inventorylinear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

In the numerical example of §6 (T=3T=3T=3; p0=2/3p_0=2/3p0​=2/3, p1=0p_1=0p1​=0, p2=1/3p_2=1/3p2​=1/3; C1(i)=iC_1(i)=iC1​(i)=i, C2(j)=3jC_2(j)=3jC2​(j)=3j, C3(m)=max⁡[0,6m]C_3(m)=\max[0,6m]C3​(m)=max[0,6m]; j∈{0,1}j\in\{0,1\}j∈{0,1}), the expected shortage costs ∑npnC3(n−i−j)\sum_np_nC_3(n-i-j)∑n​pn​C3​(n−i−j) on the pairs (0,0),(0,1),(1,0),(1,1),(2,0),(2,1),(3,0)(0,0),(0,1),(1,0),(1,1),(2,0),(2,1),(3,0)(0,0),(0,1),(1,0),(1,1),(2,0),(2,1),(3,0) are

4, 2, 2, 0, 0, 0, 0,4,\ 2,\ 2,\ 0,\ 0,\ 0,\ 0,4, 2, 2, 0, 0, 0, 0,

and the cost coefficients (10) cij=C1(i)+C2(j)+∑npnC3(n−i−j)c_{ij}=C_1(i)+C_2(j)+\sum_np_nC_3(n-i-j)cij​=C1​(i)+C2​(j)+∑n​pn​C3​(n−i−j) are

c00=4, c01=5, c10=3, c11=4, c20=2, c21=5, c30=3.c_{00}=4,\ c_{01}=5,\ c_{10}=3,\ c_{11}=4,\ c_{20}=2,\ c_{21}=5,\ c_{30}=3.c00​=4, c01​=5, c10​=3, c11​=4, c20​=2, c21​=5, c30​=3.

These are the objective coefficients of the example's linear program.

Formalization Note The coefficients are computed from the general definition (10) applied to the example's data.

Preamble
import Mathlib
import Definitions.Def_ManneLP_Equilibrium_Model
import Definitions.Def_ManneLP_Equilibrium_LP
import Definitions.Def_ManneLP_Equilibrium_Example
Formal statement
namespace ManneLP.Equilibrium

theorem table1_cost_coefficients :
    (∑' n : ℕ, exampleModel.p n * exampleModel.C₃ ((n : ℤ) - 0 - 0) = 4 ∧
      ∑' n : ℕ, exampleModel.p n * exampleModel.C₃ ((n : ℤ) - 0 - 1) = 2 ∧
      ∑' n : ℕ, exampleModel.p n * exampleModel.C₃ ((n : ℤ) - 1 - 0) = 2 ∧
      ∑' n : ℕ, exampleModel.p n * exampleModel.C₃ ((n : ℤ) - 1 - 1) = 0 ∧
      ∑' n : ℕ, exampleModel.p n * exampleModel.C₃ ((n : ℤ) - 2 - 0) = 0 ∧
      ∑' n : ℕ, exampleModel.p n * exampleModel.C₃ ((n : ℤ) - 2 - 1) = 0 ∧
      ∑' n : ℕ, exampleModel.p n * exampleModel.C₃ ((n : ℤ) - 3 - 0) = 0) ∧
    (costCoeff exampleModel 0 0 = 4 ∧ costCoeff exampleModel 0 1 = 5 ∧
      costCoeff exampleModel 1 0 = 3 ∧ costCoeff exampleModel 1 1 = 4 ∧
      costCoeff exampleModel 2 0 = 2 ∧ costCoeff exampleModel 2 1 = 5 ∧
      costCoeff exampleModel 3 0 = 3) := by sorry

end ManneLP.Equilibrium
Source
Manne, Linear Programming and Sequential Decisions, Management Science 6 (1960), p. 263 (PDF p. 6), §6, Table 1
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me