Scribd Logo
Upload

Welcome to Scribd!

  • Dynamic Programming

    Uploaded by

    Valentine Sule
    16 views4 pages
    The document describes a linear programming problem with two decision variables (X1 and X2) and three constraints. It presents the original objective function and constraints, then adds slack variables to convert it to standard form. The standard form problem is presented with coefficients written in matrix form. It then shows the simplex method performed in tableau form, moving from the initial basic feasible solution to the optimal solution with an objective value of Z=-99.7.

    Original Description:

    simplex programming

    Copyright

    © © All Rights Reserved

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes a linear programming problem with two decision variables (X1 and X2) and three constraints. It presents the original objective function and constraints, then adds slack variables to convert it to standard form. The standard form problem is presented with coefficients written in matrix form. It then shows the simplex method performed in tableau form, moving from the initial basic feasible solution to the optimal solution with an objective value of Z=-99.7.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as xlsx, pdf, or txt
    16 views4 pages

    Dynamic Programming

    Uploaded by

    Valentine Sule
    The document describes a linear programming problem with two decision variables (X1 and X2) and three constraints. It presents the original objective function and constraints, then adds slack variables to convert it to standard form. The standard form problem is presented with coefficients written in matrix form. It then shows the simplex method performed in tableau form, moving from the initial basic feasible solution to the optimal solution with an objective value of Z=-99.7.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as xlsx, pdf, or txt
    of 4

    Maximize Z = 150 X1 + 200 X2

    Subject to:

    2X1 + X2 160
    X1 + 2X2 110
    X1 + 3X2 150
    X1, X2 0

    Adding a Slack Variable to each of the constraints, the standard problem become
    Maximize Z = 150 X1 + 200 X2 + OS1 + OS2 + OS3
    S.t:

    2X1 + X2 + S1 = 160
    X1 + 2X2 + S2 = 110
    X1 + 3X2 + S3 = 150
    X1, X2, S1, S2, S3 0

    SV
    S1
    S2
    S3
    Z

    X1
    2
    1
    1
    -150

    X2
    1
    2
    (3)
    -200

    S1
    1
    0
    0
    0

    S2
    0
    1
    0
    0

    S3
    0
    0
    1
    0

    SV
    S1
    S2
    X2
    Z

    X1
    1.667
    (0.334)
    0.333
    -83.4

    X2
    0
    0
    1
    0

    S1
    1
    0
    0
    0

    S2
    0
    1
    0
    0

    S3
    -0.333
    -0.666
    0.333
    66.6

    Row 1

    (2, 1, 1, 0, 0, 160) - 1(0.333, 1, 0, 0, 0.333, 50)

    Row 2

    (1, 2, 0, 1, 0, 110) - 2(0.333, 1, 0, 0, 0.333, 50)

    Row 4

    SV
    S1
    X1
    X2
    Z

    (-150, -200, 0, 0, 0, 0) - (-200)(0.333, 1, 0, 0, 0.333, 50)

    X1
    0
    1
    0
    0

    X2
    0
    0
    1
    0

    S1
    1
    0
    0
    0

    S2
    S3
    -4.990998 2.991
    2.994
    -1.994
    -0.997002 0.997
    -99.700 -99.700

    Row 1

    (1.667, 0, 1, 0, -0.333, 110) - 1.667(1, 0, 0, 2.994, -1.994, 29.940)

    Row 3

    (0.333, 1, 0, 0, 0.333, 50) - 0.333(1, 0, 0, 2.994, -1.994, 29.940)

    Row 4

    (-83.4, 0, 0, 0, 66.6, 10,000) - (-83.4)(1, 0, 0, 2.994, -1.994, 29.940)

    Max Z = -X1 + 3X2 - 3X3


    S.t.
    3X1 - X2 - 2X3 7
    `-2X1 - 4X2 + 4X3 3
    X1 -2X3 4
    `-2X1 + 2X2 + X3 8
    3X1 5
    X1, X2, X3 0

    Max Z = -3X1 + 4X2


    S.t.
    `-4X1 - 2X2 -8
    `-2X1 -2
    3X1 + 2X2 10
    `-X1 + 3X2 1
    `-3X2 -2
    X1, X2, X3 0

    tandard problem becomes

    b
    160
    110
    150
    0

    Ratio
    160
    55
    50

    b
    110
    10
    50
    10,000

    Ratio
    65.99
    29.94
    150

    0.333, 50)

    b
    60.09
    29.94
    40.03
    12,497

    .994, -1.994, 29.940)

    94, -1.994, 29.940)


    2.994, -1.994, 29.940)

    You might also like