Audio Disks will be opening outlets in the greater Phoenix area. The estimated sales at each store are dependent not only on the store location, but on the number of sales personnel, as presented in the table below ($000/year). Each store requires at least 2 sales people, and a pool of 9 salespeople is available. $$\begin{array} { c | c c c c }
& { \text { Staff Size } } \
& 2 & 3 & 4 & 5 \
\hline \text { Store 1 } & 60 & 85 & 90 & 100 \
\text { Store 2 } & 105 & 120 & 130 & 150 \
\text { Store 3 } & 120 & 145 & 160 & 175
\end{array}$$
a.What would the states be in the dynamic programming formulation?
b.Draw the network that represents the dynamic programming formulation.
c.Given the above network, solve the sales personnel allocation problem by finding the longest path.

Question

Audio Disks will be opening outlets in the greater Phoenix area. The estimated sales at each store are dependent not only on the store location, but on the number of sales personnel, as presented in the table below ($000/year). Each store requires at least 2 sales people, and a pool of 9 salespeople is available. $$\begin{array} { c | c c c c } 
& { \text { Staff Size } } \
& 2 & 3 & 4 & 5 \
\hline \text { Store 1 } & 60 & 85 & 90 & 100 \
\text { Store 2 } & 105 & 120 & 130 & 150 \
\text { Store 3 } & 120 & 145 & 160 & 175
\end{array}$$ 
a.What would the states be in the dynamic programming formulation?
b.Draw the network that represents the dynamic programming formulation.
c.Given the above network, solve the sales personnel allocation problem by finding the longest path.

Quizplus · Accepted Answer

The Answer of Audio Disks will be opening outlets in the greater Phoenix area. The estimated sales at each store are dependent not only on the store location, but on the number of sales personnel, as presented in the table below ($000/year). Each store requires at least 2 sales people, and a pool of 9 salespeople is available. $$\begin{array} { c | c c c c } 
& { \text { Staff Size } } \
& 2 & 3 & 4 & 5 \
\hline \text { Store 1 } & 60 & 85 & 90 & 100 \
\text { Store 2 } & 105 & 120 & 130 & 150 \
\text { Store 3 } & 120 & 145 & 160 & 175
\end{array}$$ 
a.What would the states be in the dynamic programming formulation?
b.Draw the network that represents the dynamic programming formulation.
c.Given the above network, solve the sales personnel allocation problem by finding the longest path.

Audio Disks Will Be Opening Outlets in the Greater Phoenix