17) Table M2-3
The above information describes a shortest-route problem with the distance in miles.
How many stages will this dynamic programming problem have?
A) 8
B) 4
C) 3
D) 2
E) 1
18) In the transportation problem, using the stepping-stone method,
A) you may not skip over an empty cell.
B) you may not skip over a used cell.
C) your path may not cross over itself.
D) if you have an optimal solution and get an improvement index of zero, there is
another optimal solution.
E) None of the above
19) A professor decides to hold a three hour window open for student advising. The
professor has 15 advisees. He’s unsure if each advisee will show up, and its possible
that a single advisee could show up multiple times during the 3 hour window. On
average, the professor will spend 12 minutes with each student. He usually expects each
student to arrive once during the 3 hour window.
(a) What proportion of the time can the professor expect to be busy during the window?
(b) What is the expected number of students in queue during the window?
(c) What is the expected wait time in queue during the window?