Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 3, Eq. (14) — at the optimal stock, E(P, x_M(P)) = −kP²(P₀ − P)/(P + L)

Proved
WhitinPrice.StyleGoods.eq_14_optimal_expected_profit

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

inventorynewsvendorp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1pricing

In the style-goods model (Whitin 1955, §3) with P0P_0P0​, L>0L > 0L>0, k<0k < 0k<0, mean demand μ(P)=k(P−P0)\mu(P) = k(P - P_0)μ(P)=k(P−P0​) and demand uniform on [0,2μ(P)][0, 2\mu(P)][0,2μ(P)], let E(P,x)E(P, x)E(P,x) be the expected profit of stocking xxx units at unit profit PPP and xM(P)=−2kP(P0−P)/(P+L)x_M(P) = -2kP(P_0 - P)/(P + L)xM​(P)=−2kP(P0​−P)/(P+L) the equilibrium stock (12). For every 0<P<P00 < P < P_00<P<P0​,

E(P,xM(P))=−kP2(P0−P)P+L.E\big(P, x_M(P)\big) = -\frac{kP^2(P_0 - P)}{P + L}.E(P,xM​(P))=−P+LkP2(P0​−P)​.

This is the maximal expected profit attainable at unit profit PPP, as a function of PPP alone; maximizing it over PPP is the pricing problem whose stationary condition is the quadratic (15).

Formalization Note Because k<0k < 0k<0, the right-hand side is positive on 0<P<P00 < P < P_00<P<P0​.

Preamble
import Mathlib
import Definitions.Def_WhitinPrice_StyleGoods_Model
Formal statement
namespace WhitinPrice.StyleGoods
theorem eq_14_optimal_expected_profit (k P₀ L P : ℝ) (hk : k < 0) (hL : 0 < L) (hP : 0 < P)
    (hPP₀ : P < P₀) :
    expectedProfit k P₀ L P (optimalStock k P₀ L P) = -(k * P ^ 2 * (P₀ - P)) / (P + L) := by sorry
end WhitinPrice.StyleGoods
Source
Whitin, Inventory Control and Price Theory, Management Sci. 2 (1955), p. 67, Section 3, Eq. (14)
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