Appendix, proof of Theorem 3 — for c < c1 < p a credit c2 satisfying (11) exists with c3 < c2 < c1
ProvedPerishableReturns.Coordination.theorem_3_credit_rangep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1returns-policysupply-chain-coordination
In Pasternack's model, with cost data and goodwill costs (), let the retailer's price satisfy . Then there is a return credit satisfying relationship (11),
such that
This is what the paper's Appendix states must be shown to prove Theorem 3: for every admissible price the coordinating credit is a genuine partial credit, strictly between the salvage value and the price.
The printed argument for establishes only , that is , which gives only when ; the claim itself holds for every , and that claim is what is stated here.
Formalization Note. The nonnegativity of and is implicit in the paper (they are costs) and is a field of the cost data. The denominator is positive.
Preamble
import Mathlib import Definitions.Def_PerishableReturns_Coordination_Model open MeasureTheory ProbabilityTheory
Formal statement
namespace PerishableReturns.Coordination
theorem theorem_3_credit_range (K : Costs) (c1 : ℝ) (hc : K.c < c1) (hp : c1 < K.p) :
∃ c2 : ℝ,
c1 = (K.p + K.g) - (K.p + K.g2 - K.c) * (K.p + K.g - c2) / (K.p + K.g2 - K.c3) ∧
K.c3 < c2 ∧ c2 < c1 := by sorry
end PerishableReturns.Coordination
Source
Pasternack, Optimal Pricing and Return Policies for Perishable Commodities, Marketing Science 4(2) (1985), Appendix, proof of Theorem 3, p. 175
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.