Optimum inventory policies with discrete time proportional demand, discrete replenishment opportunities and different optimizing criteria (Q1060942)

This paper extends the deterministic, single product, dynamic EOQ model to the case where demand increases linearly with time but at discrete time points and where the number of replenishments is also discrete. The problem is to find the number of orders and the replenishment schedule that will either maximize the return on the investment on inventory or minimize inventory costs. The proposed solution to either problem requires to first find the replenishment schedule that will minimize the total inventory throughout the planning horizon, for a given number of orders and then find the optimal number of replenishment points. The solution algorithms exploit the discrete nature of the demand and do not require the decomposability property of dynamic programming. This is particularly important in the return on investment case, where decomposability cannot be achieved.