# Probabilistic Inventory Models

Pages: 5 (1270 words) Published: June 11, 2011
Probabilistic Inventory Models
1. CONTINUOUS REVIEW MODELS
1.1 "Probabilitized" EOQ Model
Some practitioners have sought to adapt the deterministic EOQ model to reflect the probabilistic nature of demand by using an approximation that superimposes a constant buffer stock on the inventory level throughout the entire planning horizon. The size of the buffer is determined such that the probability of running out of stock during lead time (the period between placing and receiving an order) does not exceed a prespecified value. Let

L = Lead time between placing and receiving an order
[pic] = Random variable representing demand during lead time [pic] = Average demand during lead time
[pic]= Standard deviation of demand during lead time
B = Buffer stock size
a = Maximum allowable probability of running out of stock during lead time The main assumption of the model is that the demand,[pic] ，during lead time L is normally distributed with mean [pic] and standard deviation [pic]-that is, N([pic], [pic]) FIGURE 14.1

Buffer stock imposed on the classical EOQ model
[pic]
Figure 14.1 depicts the relationship between the buffer stock, B, and the parameters of the deterministic EOQ model that include the lead time L, the average demand during lead time, [pic] , and the EOQ, y*. Note that L must equal the effective lead time. The probability statement used to determine B can be written as P {[pic] [pic] B +[pic]} [pic] [pic]

We can convert [pic] into a standard N (O, 1) random variable by using the following substitution [pic]
Thus, we have
[pic]
Figure 14.2 defines [pic] such that
[pic]
Hence, the buffer size must satisfy
[pic]
The demand during the lead time L usually is described by a probability density function per unit time (e.g., per day or week), from which the distribution of the demand during L can be determined. Given that the demand per unit time is normal with mean D and standard deviation [pic], the mean and standard deviation, [pic] and [pic], of demand during lead time, L, are computed as [pic]

The formula for [pic] requires L to be (rounded to) an integer value. [pic]
Example
EOQ = 1000 units. If the daily demand is normal with mean D = 100 lights and standard deviation [pic] = 10 lights-that is, N (100, 10)-determine the buffer size so that the probability of running out of stock is below a = .05. We know, the effective lead time is L = 2 days. Thus,

[pic]
Given [pic]= 1.645, the buffer size is computed as
B [pic] 14.14 * 1.645 [pic] 23 neon lights
Thus, the optimal inventory policy with buffer B calls for ordering 1000 units whenever the inventory level drops to 223 (= B + [pic]= 23 + 2 * 100) units.

1.2 Probabilistic EOQ Model
There is no reason to believe that the "probabilitized" EOQ model will produce an optimal inventory policy. The fact that pertinent information regarding the probabilistic nature of demand is initially ignored, only to be "revived" in a totally independent manner at a later stage of the calculations, is sufficient to refute optimality. To remedy the situation, a more accurate model is presented in which the probabilistic nature of the demand is included directly in the formulation of the model. Unlike the case in Section 1.1, the new model allows shortage of demand, as Figure 14.3 demonstrates. The policy calls for ordering the quantity y whenever the inventory drops to level R. As in the deterministic case, the reorder level R is a function of the lead time between placing and receiving an order. The optimal values of y and R are determined by minimizing the expected cost per unit time that includes the sum of the setup, holding, and shortage costs. [pic]

The model has three assumptions.
1. Unfilled demand during lead time is backlogged.
2. No more than one outstanding order is allowed.
3. The distribution of demand during lead time remains stationary (unchanged) with time.

To develop the total cost function per unit time, let
f(x) = pdf of demand, x,...
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}