Writing expressions, Markov Models

Click For Summary
SUMMARY

This discussion focuses on developing a Markov model to analyze the food supply dynamics of a food bank, considering limited storage capacity and fluctuating donations and demands. The expression for the food available at the end of week n is defined as Xn+1 = Max(Min(Xn + Sn, 2) - dn, 0), where Sn represents the food donated and dn represents the food demanded. The transition probability matrix derived from the model indicates the probabilities of moving between states of food availability, with the final matrix being:
.82 .18 .00
.70 .30 .00
.70 .30 .00.

PREREQUISITES
  • Understanding of Markov models and state transitions
  • Familiarity with probability distributions and matrices
  • Knowledge of bounded functions and their implications in modeling
  • Basic concepts of supply and demand in resource management
NEXT STEPS
  • Study Markov Chain theory and its applications in resource management
  • Learn about transition probability matrices and their construction
  • Explore bounded functions and their use in mathematical modeling
  • Investigate real-world applications of food bank operations and inventory management
USEFUL FOR

Data scientists, operations researchers, and anyone involved in resource allocation and inventory management, particularly in non-profit sectors like food banks.

USN2ENG
Messages
107
Reaction score
0

Homework Statement



Through donations the food bank tries to feed as many people as possible. Assume there are no backorders - any unsatisfied demand is lost. The food bank also has limited facilities to store donations, 200,000lbs maximum can be held in storage. Assume donations are processed separately, and added to the supply at the beginning of each week.

The amount of food donated is represented by: ps(s) = .4 for s = 1, & = .6 for s = 2

The amount of food demand is represented by: pd(d) = .3 for d = 1, & = .7 for d = 2

Develop a model to analyze the current state of the Food Bank. Assume a Markov model is desired where the state of the system is defined to be the amount of food in the food bank at the end of the week. Let Xn = the amount of food available at the end of week n.

a. Write an expression for Xn+1
b. Find the transition probability matrix for the current situation

Homework Equations


The Attempt at a Solution



a. Write an expression for Xn+1

I am not sure how to write the expression and keep it bounded without using inequalities. Does that matter?

For the expression I have Xn+1 = Xn + Sn - dn

But, I need to bound this between 0 and 2 because it cannot go negative and it cannot store more than 200K-lbs. I think it is something like Max(Xn + Sn - dn, 0) but I don't know how to account for the upper bound.

b. Find the transition probability matrix for the current situation

I am pretty positive I have this one right. I worked out the sample space and probabilities for everything that could happen given we start with Xn = 0, 1 and 2 and came up with:


.82 .18 .00
.28 .54 .18
.00 .28 .72Thank you all for any help you can give!
 
Last edited:
Physics news on Phys.org
USN2ENG said:

Homework Statement



Through donations the food bank tries to feed as many people as possible. Assume there are no backorders - any unsatisfied demand is lost. The food bank also has limited facilities to store donations, 200,000lbs maximum can be held in storage. Assume donations are processed separately, and added to the supply at the beginning of each week.

The amount of food donated is represented by: ps(s) = .4 for s = 1, & = .6 for s = 2

The amount of food demand is represented by: pd(d) = .3 for d = 1, & = .7 for d = 2

Develop a model to analyze the current state of the Food Bank. Assume a Markov model is desired where the state of the system is defined to be the amount of food in the food bank at the end of the week. Let Xn = the amount of food available at the end of week n.

a. Write an expression for Xn+1
b. Find the transition probability matrix for the current situation



Homework Equations





The Attempt at a Solution



a. Write an expression for Xn+1

I am not sure how to write the expression and keep it bounded without using inequalities. Does that matter?

For the expression I have Xn+1 = Xn + Sn - dn

But, I need to bound this between 0 and 2 because it cannot go negative and it cannot store more than 200K-lbs. I think it is something like Max(Xn + Sn - dn, 0) but I don't know how to account for the upper bound.

b. Find the transition probability matrix for the current situation

I am pretty positive I have this one right. I worked out the sample space and probabilities for everything that could happen given we start with Xn = 0, 1 and 2 and came up with:


.82 .18 .00
.28 .54 .18
.00 .28 .72


Thank you all for any help you can give!

I don't see how you get the second row. If X0 = 1, we have X1 = 0 if S = 1 or 2 (so start the week with 2 in stock) and D = 2; and we have X1 = 1 if S = 1 or 2 and D = 1. (Presumably, extra supply is discarded if it would take stock over 2.)
 
Yeah, I just figured that out. My matrix was wrong because I was letting supply go greater than 2.

My expression should have been: Max( Min(Xn + Sn, 2) - dn, 0)

and my matrix should have been:

.82 .18 .00
.70 .30 .00
.70 .30 .00

This should be right, now.

Thanks again Mr. Vickson for the help.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 14 ·
Replies
14
Views
3K
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
5K
  • · Replies 35 ·
2
Replies
35
Views
11K
  • · Replies 21 ·
Replies
21
Views
4K
  • · Replies 23 ·
Replies
23
Views
6K
  • · Replies 14 ·
Replies
14
Views
4K