Chapter 2 - Review of statistical models Flashcards
discrete random variable
all possible values of X are countably infinite (or finite)
probability mass function
sum p(x) = 1
continuous random variables
range space is an interval (or collection of intervals) - get probability as integral from a to b
cumulative distribution function
sum from lowest value in range to current value
expectation
average or mean
- the expected value of X found by summing probability of X occuring by X
n-th moment
expectation is the first moment of X - variance is the second
variance
the expectation of (X - E(X))^2
mode
discrete = value that occurs most frequently
continuous = where probability distribution function is maximized
Queuing systems
- probabilistic models used to simulate queuing systems
- uses gamma, exponential, and Weibull distributions to model interarrival and service times
Central Limit Theorum
- if have huge sample, distribution approaches a normal distribution
- may not always be appropriate
- all our tests rely on this theorum (ex. Z or T tests)
Dominant characteristics of a probability distribution
- mean, variance, and mode
(mean and mode are the same for a gaussian distribution)
Inventory and Supply Chain
- has at least 3 random variables (number of units demanded per order/time period, time between demands, the lead time - time between placing order for stocking and receive order)
-lead-time distribution often modelled by a gamma distribution - geometric, Poisson, and negative binomial distributions are provide satisfying shapes
Reliability and Maintainability
- exponential, gamma, and Weibull distribution can be used to model time to failure
- random failure = exponential
- standby redundancy (each component has an exponential time to failure) = gamma
- many components and failure due to serious number of defects = Weibull
Bernoulli Trials/Distributions
- n trials that can be success or failure
- mean [E(X)] = p
- Variance [V(X)] = p(1-p)
Binomial distribution
- number of successes in n Bernoulli trials
- E(X) = np
- V(X) = npq
Geometric distribution
- probability that X will be the first success
- E(X) = 1/p
- V(X) = q/p^2
Poisson
- when alpha > 0:
- E(X) = V(X)
Uniform Distribution
- probability of each X is equal
Poisson Process
- counting process - a stochastic process is a counting process if N(t) represents the total number of events taht occur by time t
- Assumes:
1. arrivals occur one at a time
2. stationary increments - distribution of the numbe rof arrivals between t and t+s depends on the interval s not on t (arrivals are completely random)
3. independent increaments - number of arrivals during nonoverlapping time intervals are independent random varaibles - Poisson arrival processes can be split into 2 independent Poisson arrival processes with probability p and 1-p adn arrival rates of lambda(p) and lambda(p-1)
What models are good for inventory and supply chains?
- geometric
- Poisson
- negative binomial
(lead time = gamma distribution)