Scribd Logo
Upload

Welcome to Scribd!

  • 14 views

    Lampiran 1 (Soal No.2)

    Uploaded by

    mamad download
    1. The document describes using the simplex method to solve a linear programming problem in two phases. 2. In phase one, an initial feasible solution is determined by selecting the variable with the smallest coefficient for the objective function and making it 1 while making all other variables 0. 3. In phase two, the simplex method is used to find the optimal solution and boundaries by iteratively selecting pivot variables to make all coefficients positive.

    Copyright:

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

    Lampiran 1 (Soal No.2)

    Uploaded by

    mamad download
    14 views1 page
    1. The document describes using the simplex method to solve a linear programming problem in two phases. 2. In phase one, an initial feasible solution is determined by selecting the variable with the smallest coefficient for the objective function and making it 1 while making all other variables 0. 3. In phase two, the simplex method is used to find the optimal solution and boundaries by iteratively selecting pivot variables to make all coefficients positive.

    Original Title

    Lampiran 1 (soal no.2)

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1. The document describes using the simplex method to solve a linear programming problem in two phases. 2. In phase one, an initial feasible solution is determined by selecting the variable with the smallest coefficient for the objective function and making it 1 while making all other variables 0. 3. In phase two, the simplex method is used to find the optimal solution and boundaries by iteratively selecting pivot variables to make all coefficients positive.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    14 views1 page

    Lampiran 1 (Soal No.2)

    Uploaded by

    mamad download
    1. The document describes using the simplex method to solve a linear programming problem in two phases. 2. In phase one, an initial feasible solution is determined by selecting the variable with the smallest coefficient for the objective function and making it 1 while making all other variables 0. 3. In phase two, the simplex method is used to find the optimal solution and boundaries by iteratively selecting pivot variables to make all coefficients positive.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 1

    Fase 1 : menentukan initial feaseable solution

    : Prioritas hitung
    : nilai terkecil
    Pivot : diperoleh dari (-w) dan (bi"/ais" ) terkecil
    pivot akan dijadikan 1 dan lainya dijadikan 0

    addmissible variable artificial


    bi"/ais",
    basic variable x1 x2 x3 y1 y2 y3 y4 y5 y6 -f -w bi"
    ais">0
    y1 0.67 0.67 0.33 1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 2677.78 8033.33
    y2 0.33 0.33 0.67 0.00 1.00 0.00 0.00 0.00 0.00 0.00 0.00 2722.22 4083.33
    y3 0.00 0.50 0.125 0.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 1850.00 14800.00
    y4 0.00 0.50 0.125 0.00 0.00 0.00 1.00 0.00 0.00 0.00 0.00 1850.00 14800.00
    y5 0.00 0.00 0.25 0.00 0.00 0.00 0.00 1.00 0.00 0.00 0.00 900.00 3600.00
    y6 0.00 0.00 0.75 0.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 900.00 1200.00
    -f -1.00 -1.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00
    -w -1.00 -2.00 -2.25 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 -10900.00

    y1 0.67 0.67 0.00 1.00 0.00 0.00 0.00 0.00 -0.44 0.00 0.00 2277.78 3416.67
    y2 0.33 0.33 0.00 0.00 1.00 0.00 0.00 0.00 -0.89 0.00 0.00 1922.22 5766.67
    y3 0.00 0.50 0.00 0.00 0.00 1.00 0.00 0.00 -0.17 0.00 0.00 1700.00 3400.00
    y4 0.00 0.50 0.00 0.00 0.00 0.00 1.00 0.00 -0.17 0.00 0.00 1700.00 3400.00
    y5 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 -0.33 0.00 0.00 600.00
    x3 0.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 1.33 0.00 0.00 1200.00
    -f -1.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 1.33 1.00 0.00 1200.00
    -w -1.00 -2.00 0.00 0.00 0.00 0.00 0.00 0.00 3.00 0.00 1.00 -8200.00

    y1 0.67 0.00 0.00 1.00 0.00 -1.33 0.00 0.00 -0.22 0.00 0.00 11.11 16.67
    y2 0.33 0.00 0.00 0.00 1.00 -0.67 0.00 0.00 -0.78 0.00 0.00 788.89 2366.67
    x2 0.00 1.00 0.00 0.00 0.00 2.00 0.00 0.00 -0.33 0.00 0.00 3400.00
    y4 0.00 0.00 0.00 0.00 0.00 -1.00 1.00 0.00 0.00 0.00 0.00 0.00
    y5 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 -0.33 0.00 0.00 600.00
    x3 0.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 1.33 0.00 0.00 1200.00
    -f -1.00 0.00 0.00 0.00 0.00 2.00 0.00 0.00 1.00 1.00 0.00 4600.00
    -w -1.00 0.00 0.00 0.00 0.00 4.00 0.00 0.00 2.33 0.00 1.00 -1400.00

    x1 1.00 0.00 0.00 1.49 0.00 -1.99 0.00 0.00 -0.33 0.00 0.00 16.58
    y2 0.00 0.00 0.00 -0.50 1.00 0.00 0.00 0.00 -0.67 0.00 0.00 783.36
    x2 0.00 1.00 0.00 0.00 0.00 2.00 0.00 0.00 -0.33 0.00 0.00 3400.00
    y4 0.00 0.00 0.00 0.00 0.00 -1.00 1.00 0.00 0.00 0.00 0.00 0.00
    y5 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 -0.33 0.00 0.00 600.00
    x3 0.00 0.00 1.00 0.00 0.00 0.00 0.00 0.00 1.33 0.00 0.00 1200.00
    -f 0.00 0.00 0.00 1.49 0.00 0.01 0.00 0.00 0.67 1.00 0.00 4616.58
    -w 0.00 0.00 0.00 1.49 0.00 2.01 0.00 0.00 2.00 0.00 1.00 -1383.42
    (Sudah positif semua)

    Fase 2 : menentukan optimum boundaries menggunakan simplex method

    bi"/ais",
    basic variable x1 x2 x3 -f bi"
    ais">0
    x1 1.00 0.00 0.00 0.00 16.58
    y2 0.00 0.00 0.00 0.00 783.36
    x2 0.00 1.00 0.00 0.00 3400.00
    y4 0.00 0.00 0.00 0.00 0.00
    y5 0.00 0.00 0.00 0.00 600.00
    x3 0.00 0.00 1.00 0.00 1200.00
    -f 0.00 0.00 0.00 1.00 4616.58
    (Sudah positif semua)

    x1 16.58
    f= x2 = 3400.00 = 4616.58
    x3 1200.00

    You might also like