Scribd Logo
Upload

Welcome to Scribd!

  • 24 views

    Latian Soal 3

    Uploaded by

    Bagas Tri Pangestu
    This document contains three methods for solving an optimization problem: corner point method, least cost method, and VAM method. It presents the calculations for allocating supply across three sources (A, B, C) and three demands (1, 2, 3) for each method. The corner point method results in an optimal value (Z) of 5,925. The least cost method produces the lowest Z value of 4,550. Therefore, the document concludes that the least cost method provides the optimal solution to this allocation problem.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Latian Soal 3

    Uploaded by

    Bagas Tri Pangestu
    24 views6 pages
    This document contains three methods for solving an optimization problem: corner point method, least cost method, and VAM method. It presents the calculations for allocating supply across three sources (A, B, C) and three demands (1, 2, 3) for each method. The corner point method results in an optimal value (Z) of 5,925. The least cost method produces the lowest Z value of 4,550. Therefore, the document concludes that the least cost method provides the optimal solution to this allocation problem.

    Original Description:

    2

    Original Title

    latian soal 3

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains three methods for solving an optimization problem: corner point method, least cost method, and VAM method. It presents the calculations for allocating supply across three sources (A, B, C) and three demands (1, 2, 3) for each method. The corner point method results in an optimal value (Z) of 5,925. The least cost method produces the lowest Z value of 4,550. Therefore, the document concludes that the least cost method provides the optimal solution to this allocation problem.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    24 views6 pages

    Latian Soal 3

    Uploaded by

    Bagas Tri Pangestu
    This document contains three methods for solving an optimization problem: corner point method, least cost method, and VAM method. It presents the calculations for allocating supply across three sources (A, B, C) and three demands (1, 2, 3) for each method. The corner point method results in an optimal value (Z) of 5,925. The least cost method produces the lowest Z value of 4,550. Therefore, the document concludes that the least cost method provides the optimal solution to this allocation problem.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    of 6

    Latian soal 3

    LATIAN SOAL 3
    Tujuan Penawaran
    Asal
    1 2 3
    150
    A Add Text Add Text

    175
    B A B
    275
    C

    Permintaan 200 100 300 600


    Metode pojok kiri atas
    Tujuan/ Asal 1 2 3 Supply

    A 150 6 (-) 8 (-) 10 150

    Add Text Add Text


    B 50 7 100 11 25 11 175

    C
    A (-) 4 (-) 5
    B 275 12 275

    demand 200 100 300 600

    Ƶ = ∑X.∑C = 150 (6) + 50 (7) + 100 (11) + 25 (11) +275 (12) = 5.925
    Metode least cost
    Tujuan/ Asal 1 2 3 Supply

    A (-) 6 25 8 125 10 150

    B (-) 7 (-) 11 175 11 175

    C 200 4 75 5 (-) 12 275

    demand 200 100 300 600

    Ƶ = ∑X.∑C = 200 (4) + 25 (8) + 75 (5) + 125 (10) + 175 (11) = 4.550
    Ƶ = ∑X.∑C = 175 (7) + 25 (4) + 100 (5) + 150 (10) + 150 (12) =
    5.125
    Jadi metode yang menghasilkan nilai yang optimal adalah
    Metode VAM metode dengan nilai terkecil yaitu metode LEAST COST

    Tujuan/ Asal 1 2 3 Supply Δ1 Δ2 Δ3

    A (-) 6 (-) 8 150 10 150 8-6=2 8-6=2 10-6=4

    B 175 7 (-) 11 (-) 11 175 11-7=4 0 10-6=4

    C 25 4 100 5 150 12 275 5-4=1 5-4=1 12-4=8

    demand 200 100 300 600      

    Δ1 6-4=2 8-5=3 11-10=1

    Δ2 6-4=2 8-5=3 12-10=2

    Δ3 6-4=2 0 12-10=2
    Thank you
    Insert your subtitle here

    You might also like