Scribd Logo
Upload

Welcome to Scribd!

  • Contoh Simpleks

    Uploaded by

    Ryan Riansyah
    21 views3 pages
    The document describes an example of linear programming to maximize an objective function Z = 60X1 + 30X2 + 20X3, subject to four constraints. It provides the initial basic feasible solution and two iterations of the simplex method to solve the problem. The optimal solution is found to be Z = 280, X1 = 2, X3 = 8, S1 = 24, S4 = 5, with all other variables equal to 0.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes an example of linear programming to maximize an objective function Z = 60X1 + 30X2 + 20X3, subject to four constraints. It provides the initial basic feasible solution and two iterations of the simplex method to solve the problem. The optimal solution is found to be Z = 280, X1 = 2, X3 = 8, S1 = 24, S4 = 5, with all other variables equal to 0.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    21 views3 pages

    Contoh Simpleks

    Uploaded by

    Ryan Riansyah
    The document describes an example of linear programming to maximize an objective function Z = 60X1 + 30X2 + 20X3, subject to four constraints. It provides the initial basic feasible solution and two iterations of the simplex method to solve the problem. The optimal solution is found to be Z = 280, X1 = 2, X3 = 8, S1 = 24, S4 = 5, with all other variables equal to 0.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 3

    Contoh : Kasus Maksimasi

    Maks, Z = 60 X1 + 30 X2 + 20 X3
    s/t

    8 X1 + 6 X2 +
    X3
    4 X1 + 2 X2 + 1,5 X3
    2 X1 + 1,5 X2 + 0,5 X3
    X2

    48
    20
    8
    5

    X1, X2, X3 0
    Maks, Z = 60 X1 + 30 X2 + 20 X3
    s/t

    8 X1 + 6 X2 +
    X3 + S1
    4 X1 + 2 X2 + 1,5 X3
    + S2
    2 X1 + 1,5 X2 + 0,5 X3
    + S3
    X2
    + S4

    = 48
    = 20
    = 8
    = 5

    X1, X2, X3, S1, S2, S3, S4 0


    Iterasi 0
    BV
    Z
    S1
    S2
    S3
    S4

    Z
    1
    0
    0
    0
    0

    X1 X2 X3 S1
    -60 -30 -20 0
    8
    6
    1 1
    4
    2 1,5 0
    2 1,5 0,5 0
    0
    1
    0 0

    S2
    0
    0
    1
    0
    0

    S3
    0
    0
    0
    1
    0

    S4
    0
    0
    0
    0
    1

    Solusi
    0
    48
    20
    8
    5

    Rasio
    48/8 = 6
    20/4 = 5
    8/2 = 4
    5/0 = ~

    Iterasi 1
    BV
    Z
    S1
    S2
    X1

    Z
    1
    0
    0
    0

    X1
    0
    0
    0
    1

    S4

    X2 X3 S1
    15
    -5 0
    0
    -1 1
    -1 0,5 0
    0,7 0,2 0
    5
    5
    1
    0 0

    S2
    0
    0
    1
    0

    S3
    30
    -4
    -2
    0,5

    S4
    0
    0
    0
    0

    Solusi
    Rasio
    240
    16 16/-1 = -16
    4 4/0,5 = 8
    4 4/0,25 = 16

    X2

    0
    0
    1
    0

    S1
    0
    1
    0
    0

    S2
    10
    2
    2
    -0,5

    S3
    10
    -8
    -4
    1,5

    S4
    0
    0
    -0
    0

    Solusi
    280
    24
    8
    2

    5 5/0

    =~

    Iterasi 2
    BV
    Z
    S1
    X3
    X1

    Z
    1
    0
    0
    0

    X1
    0
    0
    0
    1

    S4

    5
    -2
    -2
    1,2
    5
    1

    X3

    Solusi Optimum :
    Z = 280
    X1 = 2; X2 = 0; X3 = 8
    S1 = 24; S2 = 0; S3 = 0; S4 = 5

    Rasio

    You might also like