4 Points) A college student has 7 days remaining before final examinations begin in her
four courses, and she wants to allocate this study time as effectively as possible. She
needs at least 1 day on each course, and she likes to concentrate on just one course each
day, so she wants to allocate 1,2,3, or 4 days to each course. Having recently taken
an OR course, she decides to use dynamic programming to make these allocations to
maximize the total grade points to be obtained from the four courses. She estimates
that the alternative allocations for each course would yield the number of grade points
shown in the following table:
Estimated Grade Points
Course
Study Days
1
2
3
4
1
1
5
4
4
2
3
6
6
4
3
6
6
7
5
4
8
8
9
8
(a) Use the graphical method for dynamic programming to determine how many of
the four days should be assigned to each of the four courses to maximize the total
expected grade points.
(b) If she decides to give only 1 day to course 1, how many ways to best allocate the
four days? You must derive the solution from the same work already performed
from (a).
(c) Find all adjacency matrices for the multi-staged bipartite graph for the problem.
