The Optimal Inventory Policy for Batch Ordering

Arthur F. Veinott
Additional contact information
Arthur F. Veinott: Stanford University, Stanford, California

Operations Research, 1965, vol. 13, issue 3, 424-432

Abstract: We consider a single product dynamic inventory problem in which the demands in each period are independent and identically distributed random variables. There is a constant lead time, a discount factor 0 ≦ α ≦ 1, a unit ordering cost c and an expected holding and penalty cost function L (·) for which −[ c ( l − α) y + L ( y )] is unimodal, and total backlogging of unfilled demand. In addition each order for stock must be in some nonnegative integral multiple of Q , a fixed positive constant. It is shown that the ( k , Q ) policy is optimal for the finite and infinite period models. With the ( k , Q ) policy if the initial inventory on hand and on order in a period is less than k , an order is placed for the smallest multiple of Q that will bring the inventory on hand and on order to at least k ; otherwise, no order is placed. The optimal value of k is easy to compute and is the same for the finite and infinite period models. The results are generalized to the case where the demand distributions and cost functions vary over time. The ( k , Q ) policy is not optimal in general for the case where there is also a fixed charge for placing an order.

Date: 1965
References: Add references at CitEc
Citations: View citations in EconPapers (36)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.13.3.424 (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:13:y:1965:i:3:p:424-432

Access Statistics for this article

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