Scribd Logo
Unggah

Selamat datang di Scribd!

  • Simplex Method (Minimization Example) : Object Function

    Diunggah oleh

    Darya Memon
    112 tayangan6 halaman
    For linear programming all the variables must be >= 0. The unrestricted variables are to be replaced with two nonnegative variables. In case of minimization choose the maximum positive value from z-equation (i.e. 3). So column containing that value is the key column. Now find out the minimum positive value in the column (b / a). Minimum value is 1.5.

    Deskripsi Asli:

    Judul Asli

    Class 10

    Hak Cipta

    © Attribution Non-Commercial (BY-NC)

    Format Tersedia

    PPTX, PDF, TXT atau baca online dari Scribd

    Apakah menurut Anda dokumen ini bermanfaat?

    Apakah konten ini tidak pantas?

    Laporkan Dokumen Ini
    For linear programming all the variables must be >= 0. The unrestricted variables are to be replaced with two nonnegative variables. In case of minimization choose the maximum positive value from z-equation (i.e. 3). So column containing that value is the key column. Now find out the minimum positive value in the column (b / a). Minimum value is 1.5.

    Hak Cipta:

    Attribution Non-Commercial (BY-NC)
    Unduh sebagai PPTX, PDF, TXT atau baca online dari Scribd
    Tandai sebagai konten tidak pantas
    112 tayangan6 halaman

    Simplex Method (Minimization Example) : Object Function

    Diunggah oleh

    Darya Memon
    For linear programming all the variables must be >= 0. The unrestricted variables are to be replaced with two nonnegative variables. In case of minimization choose the maximum positive value from z-equation (i.e. 3). So column containing that value is the key column. Now find out the minimum positive value in the column (b / a). Minimum value is 1.5.

    Hak Cipta:

    Attribution Non-Commercial (BY-NC)
    Unduh sebagai PPTX, PDF, TXT atau baca online dari Scribd
    Tandai sebagai konten tidak pantas
    dari 6

    Simplex Method (Minimization Example)

    Object Function:
    Min. z= 2x1 + 3 x2
    Constraints:
    2x1 - 3x2 x3 =- 4
    3x1 + 4x2 x4 = -6
    2x1 + 5x2 + x5= 10
    4x1 - 3x2 + x6= 18
    x3 , x4 , x5 , x6 0 and

    x1 , x2 are unrestricted

    For linear programming all the variables must be 0.


    The unrestricted variables are to be replaced with two
    nonnegative variables. 8/3/12
    1
    1

    Standard Form
    Let;
    x1 = y1 y2
    x2 = y3 y4
    x3 = y5
    x4 = y6
    x5 = y7
    x6 = y8
    Objective Function
    Min. z = 2y1 2y2 + 3y3 3y4
    z - 2y1 + 2y2 - 3y3 + 3y4 =0
    Constraints
    - 2y1 + 2y2 + 3y3 + 4y4 + y5=4
    - 3y1 + 3y2 - 4y3 + 4y4 + y6=6
    2y1 - 2y2 + 5y3 - 5y4 + y7=10
    4y1 - 4y2 - 3y3 + 8/3/12
    3y4 + y8=18

    2
    2

    Simplex Tableau 1

    Pi
    v
    o
    t
    e
    q
    .

    Basi
    c
    z
    y5
    y6

    y1 y2 y3 y4 y5 y6 y7 y8

    b/a

    -2 2
    -2 2
    -3 3

    0
    4
    6

    -3 3
    3 -3
    -4 4

    0
    1
    0

    0
    0
    1

    0
    0
    0

    0
    0
    0

    1.5

    K
    e
    y
    r
    o
    w

    2 -2 5 Key
    -5 0 K0
    ey 1 0 10
    col
    le
    E
    4 -4 -3 3 0 0 e0 1 18 6
    um
    m
    nt
    n
    In case of minimization choose the maximum
    positive value from z-equation (i.e. 3). So column
    containing that value is the key column.
    Now find out the minimum positive value in the
    column (b/a). Minimum value is 1.5.
    8/3/12
    So row containing that value is the key row.
    y7
    y8

    3
    3

    Simplex Tableau 2
    Basi y1
    c
    z -2
    y5 -2
    y6 -3
    y7 2
    y8 y1
    4
    Basi
    c
    z 0.25

    y2 y3 y4 y5 y6 y7 y8
    2 -3 3 0
    2 3 -3 1
    3 -4 4 0
    -2 5 -5 0
    -4 y3
    -3 y4
    3 y5
    0
    y2
    0
    0.25

    0
    0
    1
    0
    0
    y6

    0
    0
    0
    1
    0
    y7

    0
    0.75

    Pi
    v
    y5 - 4.25 0 0 1 0.75 0
    o K
    4.25
    Key
    t E ey
    l
    8/3/12
    e m e y4 col
    - 0.75 -1 1 0 0.25 0

    0
    0
    0
    0
    1
    y8

    b/a

    0 0
    4
    6 1.5
    10
    18
    6
    b b/a

    0 -4.5

    0 8.5

    0 1.5

    K
    e
    y
    r
    4
    o
    4

    Simplex Tableau 3(Optimum Tableau)


    Basi y1 y2 y3 y4 y5 y6 y7 y8 b b/a
    c
    z 0.25 0 0 0
    0 0 -4.5
    0.25
    0.75
    y5

    Opt
    im
    um

    - 4.25
    4.25
    Basi y1 y2
    c
    y4 - 0.75
    z 0.75
    0
    0

    1 0.75 0

    y3 y4 y5 y6 y7 y8

    8.5
    b

    b/a

    -1
    0

    1
    0

    0 0.25 0 0 1.5
    0
    0
    0.72
    0.04 5.04

    y7 - 1.75 0
    y5 1.75
    0
    0
    0

    0
    0

    0 1.25 1 0 17.5
    1 0.24 0 0.68 17.6
    8
    0
    0
    0 0.16
    0 0.12
    1 3.12
    13.5 0.96

    y4
    0
    0
    y8 6.25
    -

    -1
    1
    08/3/12
    0

    5
    5

    Solution:
    x1= y1 y2 = 2.16
    x2= y3 y4 = -3.12
    x3= y5 = 17.68
    x4= y6 = 0
    x5= y7 = 21.28
    x6= y8 = 0

    Min.8/3/12
    z = 2x1 + 3 x2

    6
    6

    Anda mungkin juga menyukai