Myopic Approximations for the Perishable Inventory Problem

Steven Nahmias
Additional contact information
Steven Nahmias: University of Pittsburgh

Management Science, 1976, vol. 22, issue 9, 1002-1008

Abstract: Recent work in describing optimal ordering policies for perishable inventory casts the problem as a multi-dimensional dynamic program, the dimensionality being one less than the useful lifetime of the product, m. As m becomes large the computational problem becomes severe so that developing approximations is a key problem. A bound on the perishing cost is obtained that is a function only of the total inventory on hand. Substituting this bound and an approximate transfer function, optimal policies can be computed myopically for the new problem. When the demand density possesses a monotone likelihood ratio, it is shown the function to be minimized is strictly pseudo-convex. Sample computations for special cases indicate that the approximation results in costs which are generally less than one percent higher than the optimal.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (32)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.22.9.1002 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:22:y:1976:i:9:p:1002-1008

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().