Scribd Logo
Upload

Welcome to Scribd!

  • 17 views

    Rizky Firstya Novani-TP3-W5-S6-R1

    Uploaded by

    kikifirstya
    A student has 7 days to study for 4 courses and wants to allocate his time optimally. He estimates the grade points he could earn from allocating 1, 2, 3, or 4 days to each course. He uses dynamic programming to find the allocation that maximizes total grade points. The problem is broken into 4 stages, one for each course, to build up the optimal solution.

    Copyright:

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

    Rizky Firstya Novani-TP3-W5-S6-R1

    Uploaded by

    kikifirstya
    17 views5 pages
    A student has 7 days to study for 4 courses and wants to allocate his time optimally. He estimates the grade points he could earn from allocating 1, 2, 3, or 4 days to each course. He uses dynamic programming to find the allocation that maximizes total grade points. The problem is broken into 4 stages, one for each course, to build up the optimal solution.

    Copyright

    © © All Rights Reserved

    Available Formats

    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 and wants to allocate his time optimally. He estimates the grade points he could earn from allocating 1, 2, 3, or 4 days to each course. He uses dynamic programming to find the allocation that maximizes total grade points. The problem is broken into 4 stages, one for each course, to build up the optimal solution.

    Copyright:

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

    Rizky Firstya Novani-TP3-W5-S6-R1

    Uploaded by

    kikifirstya
    A student has 7 days to study for 4 courses and wants to allocate his time optimally. He estimates the grade points he could earn from allocating 1, 2, 3, or 4 days to each course. He uses dynamic programming to find the allocation that maximizes total grade points. The problem is broken into 4 stages, one for each course, to build up the optimal solution.

    Copyright:

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

    Assignment

    Individual

    D6344 – Muhammad Asrol

    Session 06
    To be Submitted Week 07

    ISYE8022 – Engineering Optimization


    TP3-W7-S6-R1
    Rizky Firstya Novani
    2502395084

    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 using dynamic programming.

    ISYE8022 – Engineering Optimization


    Answer :

    Study Days Estimated Grade Points


    Course
    1 2 3 4
    1 1 5 4 4
    2 3 6 6 4
    3 6 8 7 5
    4 8 8 9 8

    1) x1, x2, x3 dan x4 adalah jumlah hari yang dialokasikan untuk course 1, course 2, course 3
    dan course 4 secara berurutan.
    2) f1(x1), f2(x2), f3(x3) dan f4(x4) adalah poin nilai masing - masing dari alokasi untuk
    setiap course.
    3) Maksimalkan nilai Z = f1(x1) + f2(x2) + f3(x3) + f4(x4)
    4) x1 + x2 + x3 + x4 <= 7
    5) Dimana x1, x2, x3, x4 >= 1

    Dibagi menjadi 4 Langkah dengan menggunakan, dimulai dari course 1 dulu sebagai Langkah 1 :

    Stage 1 : Course 1

    Course 1= x1 1 2 3 4 5 6 7
    Grade Points 1 3 6 8

    ISYE8022 – Engineering Optimization


    Stage 2 : Course 1 + Course 2

    Course 1 x1 1 2 3 4 5 6 7
    f1 (x1) 1 3 6 8
    Course 2
    f1(x1) + f2(x2)
    x2 f2(x2)
    1 5 6 8 11 13 5 5
    2 6 7 9 12 14 6
    3 8 9 11 14 16
    4 8 9 11 14
    5 1 3
    6 1
    7

    Stage 3 : Course 1 + Course 2 + Course 3

    Hari 1 2 3 4 5 6 7
    Max of f1(x1) + f2(x2) 5 6 8 11 13 14 16
    0+2 0+3 3+3
    Hari-hari pada 0+1 3+1 4+1 4+3
    1+1 2+1 4+2
    course 1 + 2
    Course
    3 f1(x1) + f2(x2) + f3(x3)
    x3 f3(x3)

    1 4 9 10 12 15 17 18
    2 6 11 12 14 17 19
    3 7 12 13 15 18
    4 9 14 15 17
    5 5 6
    6 5
    7

    ISYE8022 – Engineering Optimization


    Stage 4 : Course 1 + Course 2 + Course 3 + Course 4

    Hari 1 2 3 4 5 6
    Max of f1(x1) + f2(x2) + f3(x3) 5 9 11 12 15 17
    Hari-hari pada course 1 + 2 + 3 0+1+3
    3+1+2
    0+1+0 0+1+1 0+1+2 1+1+2 3+1+1 4+1+1
    2+1+1
    Days in course 4 6 5 4 3 2 1
    f4(x4) 8 5 4 4
    f1(x1) + f2(x2) + f3(x3) + 5 9 19 17 19 21
    f4(x4)

    Titik maksimum adalah 21 dan kemungkinan alokasi optimal adalah sebagai berikut :

    Course Course Course Course


    1 2 3 4
    3 1 2 1
    4 1 1 1

    Ada 2 pilihan untuk alokasi optimal sesuai perhitungan di atas. Poin yang berbeda berasal dari
    course 1 dan course 3.

    ISYE8022 – Engineering Optimization

    You might also like