Question: Problem 1 . ( 3 5 points ) Consider a n inventory system, where a t the beginning o f period k , the inventory

Problem 1.(35 points) Consider an inventory system, where at the beginning of period k,
the inventory level isSk, and we can order xk units of goods. The available units of goods are
then used to serve a random demand Wk, and the amount of inventory carried over to the
next period isSk+1=max{0,Sk+xk-Wk}.We assume that Sk,xk,Wk are non-negative
integers, and that the random demand Wk follows the probability distribution
P(Wk=0)=0.1,P(Wk=1)=0.8-0.2k,P(Wk=2)=0.1+0.2k, for all k=1,2,3.
In each stage, the cost consists of a ordering cost xk, a holding cost of2max{0,Sk+xk-Wk}
and a backorder cost of5max{0,Wk-Sk-xk}.In sum, the cost function is given by
Ck(Sk,xk,Wk)=xk+2max{0,Sk+xk-Wk}+5max{0,Wk-Sk-xk}
Let Jk(Sk,xk)be the cost function from period kto period 3 given that the inventory level
at the beginning of period kisSk and the ordering quantity isxk. The cost function upon
the optimal decision is denoted asJk*(Sk). The dynamic relation is given by
Jk(Sk,xk)=EWk[Ck(Sk,xk,Wk)+Jk+1*(max{0,Sk+xk-Wk})]
Now, consider a3-period problem . Our goal isto find the optimal ordering quantities
x1,x2,x3 that minimize the total expected cost over the 3 periods.
(a) Verify that
Jk(Sk,xk)=xk+Jk(Sk+xk,0).
(b) Calculate the optimal cost given S1=0.(Hint: the result in(a) can help to simplify
the calculation.) can you slove the problem
Problem 1 . ( 3 5 points ) Consider a n inventory

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!