Proof of Theorem 5: and for
ProvedAssortSearch.SearchQC.J_pos_N_negassortment-planningconsumer-searchp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let and , and let with derivative . For every ,
The paper observes that "because each term is positive" and asserts ("It can be shown that "). Together with (7), these signs show that at a critical point of the terms and have the same sign.
Preamble
import Mathlib import Definitions.Def_AssortSearch_SearchQC_ProofTerms
Formal statement
namespace AssortSearch.SearchQC
/-- p. 15: for `λ > 0`, `V_S > 0` and `v_j = x > 0`, `J(x) > 0` and `N(x) < 0`. -/
theorem J_pos_N_neg (lam VS x : ℝ) (hlam : 0 < lam) (hVS : 0 < VS) (hx : 0 < x) :
0 < Jfn lam VS x ∧ Nfn lam VS x < 0 := by sorry
end AssortSearch.SearchQC
Source
Cachon, Terwiesch & Xu, Retail Assortment Planning in the Presence of Consumer Search, working paper (Dec. 20, 2002), p. 15 (PDF 17), proof of Theorem 5
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.