. A fair die is rolled repeatedly. Let X denote the largest number shown up after the n-th roll, n = 1, 2, .... a) Determine the transition probability matrix. ( c) Find the limiting probabilities for each state.

MATLAB: An Introduction with Applications
6th Edition
ISBN:9781119256830
Author:Amos Gilat
Publisher:Amos Gilat
Chapter1: Starting With Matlab
Section: Chapter Questions
Problem 1P
icon
Related questions
Question

help solve, show all steps. please!

6
A fair die is rolled repeatedly. Let X denote the largest number shown up after the n-th roll, n = 1, 2, … … ….
a) Determine the transition probability matrix.
c) Find the limiting probabilities for each state.
Transcribed Image Text:6 A fair die is rolled repeatedly. Let X denote the largest number shown up after the n-th roll, n = 1, 2, … … …. a) Determine the transition probability matrix. c) Find the limiting probabilities for each state.
.
A single product inventory system with a storage capacity of 2 units is replenished weekly using the following
policy: if there are 0 or 1 units in stock, order up to the storage capacity; else, do not order. Weekly demands
are iid rv's with pmf P(D = k) = 0.1+ 0.1k, k = 0, 1, 2, 3. Any unmet demand is lost. Assume zero order re-
plenishment time. For any week, the ordering cost is 3n, where n is the number of units ordered during the week.
The weekly storage cost is 1.5m, where m is the number of units on hand at the beginning of the week (before ordering).
a) Calculate the long-run expected average total cost (LREAC) of ordering and storage for this policy. (
b) An alternative ordering policy is considered: if there are zero units in stock, order 2 units; else, do not order.
Compare this policy to the original one on the basis of LREAC. (
Transcribed Image Text:. A single product inventory system with a storage capacity of 2 units is replenished weekly using the following policy: if there are 0 or 1 units in stock, order up to the storage capacity; else, do not order. Weekly demands are iid rv's with pmf P(D = k) = 0.1+ 0.1k, k = 0, 1, 2, 3. Any unmet demand is lost. Assume zero order re- plenishment time. For any week, the ordering cost is 3n, where n is the number of units ordered during the week. The weekly storage cost is 1.5m, where m is the number of units on hand at the beginning of the week (before ordering). a) Calculate the long-run expected average total cost (LREAC) of ordering and storage for this policy. ( b) An alternative ordering policy is considered: if there are zero units in stock, order 2 units; else, do not order. Compare this policy to the original one on the basis of LREAC. (
Expert Solution
steps

Step by step

Solved in 4 steps with 25 images

Blurred answer
Recommended textbooks for you
MATLAB: An Introduction with Applications
MATLAB: An Introduction with Applications
Statistics
ISBN:
9781119256830
Author:
Amos Gilat
Publisher:
John Wiley & Sons Inc
Probability and Statistics for Engineering and th…
Probability and Statistics for Engineering and th…
Statistics
ISBN:
9781305251809
Author:
Jay L. Devore
Publisher:
Cengage Learning
Statistics for The Behavioral Sciences (MindTap C…
Statistics for The Behavioral Sciences (MindTap C…
Statistics
ISBN:
9781305504912
Author:
Frederick J Gravetter, Larry B. Wallnau
Publisher:
Cengage Learning
Elementary Statistics: Picturing the World (7th E…
Elementary Statistics: Picturing the World (7th E…
Statistics
ISBN:
9780134683416
Author:
Ron Larson, Betsy Farber
Publisher:
PEARSON
The Basic Practice of Statistics
The Basic Practice of Statistics
Statistics
ISBN:
9781319042578
Author:
David S. Moore, William I. Notz, Michael A. Fligner
Publisher:
W. H. Freeman
Introduction to the Practice of Statistics
Introduction to the Practice of Statistics
Statistics
ISBN:
9781319013387
Author:
David S. Moore, George P. McCabe, Bruce A. Craig
Publisher:
W. H. Freeman