Scribd Logo
Upload

Welcome to Scribd!

  • 222 views

    Tugas Kelompok Ke-1 Minggu 05 / Session 06 Submitted by

    Uploaded by

    Dhadung Prihananto
    A student has 7 days to study for 4 courses before their final exams. They want to allocate 1-4 days to each course to maximize their total grade points. Dynamic programming is used to determine the optimal allocation. The results show that allocating 4 days to course 1, 1 day each to courses 2, 3, and 4 will yield a maximum score of 21 points. Alternatively, allocating 3 days to course 1, and 1, 2, and 1 days respectively to courses 2, 3, and 4 will also yield a maximum score of 21 points.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd

    Tugas Kelompok Ke-1 Minggu 05 / Session 06 Submitted by

    Uploaded by

    Dhadung Prihananto
    222 views5 pages
    A student has 7 days to study for 4 courses before their final exams. They want to allocate 1-4 days to each course to maximize their total grade points. Dynamic programming is used to determine the optimal allocation. The results show that allocating 4 days to course 1, 1 day each to courses 2, 3, and 4 will yield a maximum score of 21 points. Alternatively, allocating 3 days to course 1, and 1, 2, and 1 days respectively to courses 2, 3, and 4 will also yield a maximum score of 21 points.

    Original Title

    TK1.doc

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    A student has 7 days to study for 4 courses before their final exams. They want to allocate 1-4 days to each course to maximize their total grade points. Dynamic programming is used to determine the optimal allocation. The results show that allocating 4 days to course 1, 1 day each to courses 2, 3, and 4 will yield a maximum score of 21 points. Alternatively, allocating 3 days to course 1, and 1, 2, and 1 days respectively to courses 2, 3, and 4 will also yield a maximum score of 21 points.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    222 views5 pages

    Tugas Kelompok Ke-1 Minggu 05 / Session 06 Submitted by

    Uploaded by

    Dhadung Prihananto
    A student has 7 days to study for 4 courses before their final exams. They want to allocate 1-4 days to each course to maximize their total grade points. Dynamic programming is used to determine the optimal allocation. The results show that allocating 4 days to course 1, 1 day each to courses 2, 3, and 4 will yield a maximum score of 21 points. Alternatively, allocating 3 days to course 1, and 1, 2, and 1 days respectively to courses 2, 3, and 4 will also yield a maximum score of 21 points.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    You are on page 1of 5

    Tugas Kelompok ke-1 Minggu 05 / Session 06

    Submitted by:
    Dhadung Prihananto (2140071352)

    Chandra Hosen (2140073540)

    Marco Reinaldi (2140071213)

    Dio Fawwaz Prakoso (2140071371)

    Leonel Hornai Da Cruz (2140074096)

    1. A master student has 7 days remaining before final examinations begin in his four
    courses, and he wants to allocate this study time as effectively as possible. He needs at
    least 1 day on each course, and he likes to concentrate on just one course each day, so he
    wants to allocate 1, 2, 3, or 4 days to each course. He decides to use dynamic
    programming to make these allocations to maximize the total grade points to be obtained
    from the four courses. He estimates that the alternative allocations for each course would
    yield the number of grade points shown in the following table:

    Solve this problem by dynamic programming.

    ISYE9001 - Engineering Optimization


    Solution:

    Let xn = number days allocated to a course

    pn(xn) = grade points earned from allocating xn days to course n

    sn = number of days remaining

    fn(sn) = max { pn(xn) + fn+1*(sn-xn) }

    ISYE9001 - Engineering Optimization


    ISYE9001 - Engineering Optimization
    Summary Result

    Course 4

    s4 f4*(s4) x4*

    1 4 1

    2 4 2

    3 5 3

    4 8 4

    Course 3
    s3 1 2 3 4 f3*(s3) x3*
    2 8       8 1
    3 8 10     10 2
    4 9 10 11 11 3
    5 12 11 11 13 13 4

    ISYE9001 - Engineering Optimization


    course 2
    s2 1 2 3 4 f2*(s3) x2*
    3 13 13 1
    4 15 14     15 1
    5 16 16 16 16 1,2,3
    6 18 17 18 16 18 1,3

    course 1
    s1 1 2 3 4 f1*(s1) x1*
    7 19 19 21 21 21 3,4

    Dari hasil analisa dynamic programming di atas, dapat solusi untuk maksimal score yang
    akan di dapat = 21, jika

    Pelajar mempelajari course 1 selama 4 hari, course 2 selama 1 hari, course 3 selama 1 hari,
    course 4 selama 1 hari

    ATAU

    Pelajar mempelajari course 1 selama 3 hari, course 2 selama 1 hari, course 3 selama 2 hari,
    course 4 selama 1 hari

    Study days Final


      Course 1 Course 2 Course 3 Course 4 Score
    option 1 4 1 1 1 21
    option 2 3 1 2 1 21

    ISYE9001 - Engineering Optimization

    You might also like