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: Study Days 1 2 3 4 1 1 3 6 8 Estimated Grade Points 2 5 6 8 8 Course 3 4 6 7 9 4 4 4 5 8

MATLAB: An Introduction with Applications
6th Edition
ISBN:9781119256830
Author:Amos Gilat
Publisher:Amos Gilat
Chapter1: Starting With Matlab
Section: Chapter Questions
Problem 1P
icon
Related questions
Question
2. 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:
Stage 4:
n = 4
Stage 3:
n = 3
Xn
These four courses can be considered as the four stages in a dynamic programming formulation. The decision
variables (n = 1, 2, 3,4) are the number of days to allocate to stage (course) n.
Let S = number of days still available for allocation to remaining courses (n,...,4).
Stage 2:
n = 2
Stage 1:
n = 1
S4 f4* (S4)
1
2
3
4
X3
S3
x2
S2
S1
7
Study Days
Course
1
2
1
5
IMMI
3
6
6
8
8
8
X1
1
2
3
Estimated Grade Points
4
(a) Draw a graphical display of this problem, showing the possible states at each stage, the possible transitions
in states, and the corresponding contributions to the measure of performance (grade points).
(b) Use dynamic programming to determine how many of days should be assigned to each of the four courses
to maximize the total grade points. Please use the tables given below.
3
X4
4
6
7
9
ƒ3(S3, X3) = P3(x3) + ƒ4* (S3 − X3)
4
ƒ₂ ($₂,x₂) = P₂ (x₂) + ƒ3 (S₂ − x₂)
f₁($₁, x₁) = P₁(x₁) + f₂ (≤₁ − x₁)
4
4
5
8
f3* (S3) x3
f2* (S₂) x₂
fi (S₁)
x₁
Transcribed Image Text:2. 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: Stage 4: n = 4 Stage 3: n = 3 Xn These four courses can be considered as the four stages in a dynamic programming formulation. The decision variables (n = 1, 2, 3,4) are the number of days to allocate to stage (course) n. Let S = number of days still available for allocation to remaining courses (n,...,4). Stage 2: n = 2 Stage 1: n = 1 S4 f4* (S4) 1 2 3 4 X3 S3 x2 S2 S1 7 Study Days Course 1 2 1 5 IMMI 3 6 6 8 8 8 X1 1 2 3 Estimated Grade Points 4 (a) Draw a graphical display of this problem, showing the possible states at each stage, the possible transitions in states, and the corresponding contributions to the measure of performance (grade points). (b) Use dynamic programming to determine how many of days should be assigned to each of the four courses to maximize the total grade points. Please use the tables given below. 3 X4 4 6 7 9 ƒ3(S3, X3) = P3(x3) + ƒ4* (S3 − X3) 4 ƒ₂ ($₂,x₂) = P₂ (x₂) + ƒ3 (S₂ − x₂) f₁($₁, x₁) = P₁(x₁) + f₂ (≤₁ − x₁) 4 4 5 8 f3* (S3) x3 f2* (S₂) x₂ fi (S₁) x₁
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Similar questions
Recommended textbooks for you
MATLAB: An Introduction with Applications
MATLAB: An Introduction with Applications
Statistics
ISBN:
9781119256830
Author:
Amos Gilat
Publisher:
John Wiley & Sons Inc
Probability and Statistics for Engineering and th…
Probability and Statistics for Engineering and th…
Statistics
ISBN:
9781305251809
Author:
Jay L. Devore
Publisher:
Cengage Learning
Statistics for The Behavioral Sciences (MindTap C…
Statistics for The Behavioral Sciences (MindTap C…
Statistics
ISBN:
9781305504912
Author:
Frederick J Gravetter, Larry B. Wallnau
Publisher:
Cengage Learning
Elementary Statistics: Picturing the World (7th E…
Elementary Statistics: Picturing the World (7th E…
Statistics
ISBN:
9780134683416
Author:
Ron Larson, Betsy Farber
Publisher:
PEARSON
The Basic Practice of Statistics
The Basic Practice of Statistics
Statistics
ISBN:
9781319042578
Author:
David S. Moore, William I. Notz, Michael A. Fligner
Publisher:
W. H. Freeman
Introduction to the Practice of Statistics
Introduction to the Practice of Statistics
Statistics
ISBN:
9781319013387
Author:
David S. Moore, George P. McCabe, Bruce A. Craig
Publisher:
W. H. Freeman