Abstract
A general procedure is presented for constructing approximations of discrete review single product dynamic inventory models. Bounds are derived for the approximations and compared with the ones ofHinderer [1978],Whitt [1978] for the approximation of a general dynamic program. “Good” order-policies are constructed. Finally, conditions are given under which the sequence of bounds associated with a sequence of approximating models converges to zero.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have