Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

4 . Please use Discrete Markov Chain and Excel to solve the problem. During any period, a potential customer arrives at a certain facility with

4. Please use Discrete Markov Chain and Excel to solve the problem.
During any period, a potential customer arrives at a certain facility with probability 0.5. If there are already two people at the facility (including the one being served), the potential customer leaves the facility immediately and never returns. However, if there is one person or less, the person enters the facility and becomes an actual customer. The manager of the facility has two types of service configurations available. At the beginning of each period, a decision must be made on which configuration to use. If the manager uses the slow configuration at a cost of $3 and any customers are present during the period, one customer will be served and leave the facility with probability 0.6. If the manager uses the fast configuration at a cost of $9 and any customers are present during the period, one customer will be served and leave the facility with probability 0.8. The probability of more than one customer arriving or more than one customer being served in a period is zero. A profit of $50 is earned when a customer is served.
a) Formulate the problem of choosing the service configuration period by period as a Markov decision process. Identify the states and decisions. For each combination of state and decision, find the expected net immediate cost (subtracting any profit from serving a customer) incurred during that period.
b) Identify all the (stationary deterministic) policies. For each one, find the transition matrix and write an expression for the (long-run) expected average net cost per period in terms of the unknown steady-state probabilities(pi_1, pi_2,...,pi_M).
c) Compute the steady-state probabilities for each policy by hand or using any software you like. Then evaluate the expression obtained in part (b) to find the optimal policy by exhaustive enumeration.

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Strategic management concepts

Authors: Fred david

13th Edition

9780136120988, 136120997, 136120989, 978-0136120995

More Books

Students also viewed these General Management questions