Higher-Order Approximations for the Perishable-Inventory Problem

Steven Nahmias
Additional contact information
Steven Nahmias: University of Pittsburgh, Pittsburgh, Pennsylvania

Operations Research, 1977, vol. 25, issue 4, 630-640

Abstract: Computation of an optimal policy for ordering a perishable commodity with a fixed lifetime of m periods requires the solution of a dynamic program whose state variable has dimension m − 1. Unless m is small, the computations quickly become unreasonable. By bounding the expected outdating function and using an approximate transfer function, we obtain an approximation of the original problem that can be computed as if the lifetime were r m periods. When r = 2, it is demonstrated under reasonable assumptions that the appropriate function to be minimized each period is quasi-convex. We include computations that compare this approximation to both the optimal policy and a critical number approximation.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (17)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.25.4.630 (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:oropre:v:25:y:1977:i:4:p:630-640

Access Statistics for this article

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