A college student has 5 days remaining before final examinations begin in her four modules, and she wants to allocate this study time as effectively as possible. She likes to concentrate on just one module each day, so she wants to allocate 0, 1, 2, 3 or 4 days to each module. She estimates that alternative allocations for each module would yield the number of score points shown in the table below. Number of days Module 1 0 0 1 3 2 5 3 7 4 8 Module 2 0 5 5 7 8 Module 3 0 2 6 7 8 Module 4 0 1 2 3 5 (a) Use dynamic programming to find an allocation of study days to modules to obtain the maximal total score. Explain your calculations.
A college student has 5 days remaining before final examinations begin in her four modules, and she wants to allocate this study time as effectively as possible. She likes to concentrate on just one module each day, so she wants to allocate 0, 1, 2, 3 or 4 days to each module. She estimates that alternative allocations for each module would yield the number of score points shown in the table below. Number of days Module 1 0 0 1 3 2 5 3 7 4 8 Module 2 0 5 5 7 8 Module 3 0 2 6 7 8 Module 4 0 1 2 3 5 (a) Use dynamic programming to find an allocation of study days to modules to obtain the maximal total score. Explain your calculations.
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
Please answer the question with explanation..i'll give you multiple upvote.
![A college student has 5 days remaining before final examinations begin in her four modules, and she
wants to allocate this study time as effectively as possible. She likes to concentrate on just one
module each day, so she wants to allocate 0, 1, 2, 3 or 4 days to each module. She estimates that
alternative allocations for each module would yield the number of score points shown in the table
below.
Number of days Module 1
Module 2
Module 3
Module 4
1
3
2
1
2
5
2
3
7
7
7
3
4
8
8
8
5
(a) Use dynamic programming to find an allocation of study days to modules to obtain the
maximal total score. Explain your calculations.
Having recently taken an optimisation models module, the student decided to use linear
programming to find the allocation. She amended the score table in a way that for each module i the
score column can be represented as a linear function a+b;d, where d is the non-zero number of days
allocated, and a; and b; are some constants. She decided that the score is still zero if no study days
are allocated to the module.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F30949737-f597-4b05-994f-e551e8770e10%2F74cd1361-6099-4cf3-a48b-f4f1a6f562ee%2Fjfdhs7_processed.png&w=3840&q=75)
Transcribed Image Text:A college student has 5 days remaining before final examinations begin in her four modules, and she
wants to allocate this study time as effectively as possible. She likes to concentrate on just one
module each day, so she wants to allocate 0, 1, 2, 3 or 4 days to each module. She estimates that
alternative allocations for each module would yield the number of score points shown in the table
below.
Number of days Module 1
Module 2
Module 3
Module 4
1
3
2
1
2
5
2
3
7
7
7
3
4
8
8
8
5
(a) Use dynamic programming to find an allocation of study days to modules to obtain the
maximal total score. Explain your calculations.
Having recently taken an optimisation models module, the student decided to use linear
programming to find the allocation. She amended the score table in a way that for each module i the
score column can be represented as a linear function a+b;d, where d is the non-zero number of days
allocated, and a; and b; are some constants. She decided that the score is still zero if no study days
are allocated to the module.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
![Introductory Mathematics for Engineering Applicat…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
![Introductory Mathematics for Engineering Applicat…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
![Mathematics For Machine Technology](https://www.bartleby.com/isbn_cover_images/9781337798310/9781337798310_smallCoverImage.jpg)
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
![Basic Technical Mathematics](https://www.bartleby.com/isbn_cover_images/9780134437705/9780134437705_smallCoverImage.gif)
![Topology](https://www.bartleby.com/isbn_cover_images/9780134689517/9780134689517_smallCoverImage.gif)