Scribd
Upload
14 views

Simplex Method Problem 3 - JacobA

The document presents a linear programming problem to maximize the exposure level of 1000X + 3000Y subject to four constraints on X and Y. It goes through four steps of the simplex method to solve the problem, generating a series of simplex tables that transform the constraints until an optimal basic feasible solution is found in Table 4. The final simplex table shows that the maximum exposure level is achieved when X = 150, Y = 20, and all slack and artificial variables are zero.

Uploaded by

zeonheero
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
14 views

Simplex Method Problem 3 - JacobA

The document presents a linear programming problem to maximize the exposure level of 1000X + 3000Y subject to four constraints on X and Y. It goes through four steps of the simplex method to solve the problem, generating a series of simplex tables that transform the constraints until an optimal basic feasible solution is found in Table 4. The final simplex table shows that the maximum exposure level is achieved when X = 150, Y = 20, and all slack and artificial variables are zero.

Uploaded by

zeonheero
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
You are on page 1/ 2

MAXIMIZE EXPOSURE LEVEL = 1000X + 3000Y → 1000X + 3000Y + 0S1 + 0S2 + 0S3 - 10000A1

subject to constraints
1) 4000X + 20000Y ≤ 1000000 → 4000X + 20000Y + S1 = 1000000
2) 20X + 50Y ≤ 4000 → 20X + 50Y + S2 = 4000
3) X ≥ 100 → X - S3 + A1 = 100
X, Y ≥ 0 → X, Y, S1, S2, S3, A1 ≥ 0
TABLE 1 O.C.
Cj 1000 3000 0 0 0 -10000
PRODUCT QTY. X Y S1 S2 S3 A1 QTY./O.C.
0 S1 1000000 4000 20000 1 0 0 0 → 250
0 S2 4000 20 50 0 1 0 0 → 200
-10000 A1 100 1 0 0 0 -1 1 → 100 PR
Zj -1000000 -10000 0 0 0 10000 -10000
Cj - Zj 11000 3000 0 0 -10000 0

NPR = PR/pivot element = PR/1 = same old Row 3


NR1 = old R1+(-e1)NPR = old R1+(-4000)NPR new Row 1
NR2 = old R2+(-e2)NPR = old R2+(-20)NPR new Row 2

TABLE 2 O.C.
Cj 1000 3000 0 0 0 -10000
PRODUCT QTY. X Y S1 S2 S3 A1 QTY./O.C.
0 S1 600000 0 20000 1 0 4000 -4000 → 30 PR
0 S2 2000 0 50 0 1 20 -20 → 40
1000 X 100 1 0 0 0 -1 1 → undefined
Zj 100000 1000 0 0 0 -1000 1000
Cj - Zj 0 3000 0 0 1000 -11000

NPR = PR/pivot element = PR/20000 = new Row 1


NPR = 30 0 1 5E-05 0 0.2 -0.2
NR2 = old R2+(-e2)NPR = old R2+(-20)NPR = new Row 2
NR3 = old R3+(-e3)NPR = old R3+(0)NPR = same old Row 3
TABLE 3 O.C.
Cj 1000 3000 0 0 0 -10000
PRODUCT QTY. X Y S1 S2 S3 A1 QTY./O.C.
3000 Y 30 0 1 5E-05 0 0.2 -0.2 → 150
0 S2 500 0 0 -0.0025 1 10 -10 → 50 PR
1000 X 100 1 0 0 0 -1 1 → -100
Zj 190000 1000 3000 0.15 0 -400 400
Cj - Zj 0 0 -0.15 0 400 -10400

NPR = PR/pivot element = PR/16 = new Row 2


NR1 = old R1+(-e1)NPR = old R1+(-0.2)NPR = new Row 1
NR3 = old R3+(-e3)NPR = old R3+(1)NPR = new Row 3

TABLE 4
Cj 1000 3000 0 0 0 -10000
PRODUCT QTY. X Y S1 S2 S3 A1
3000 Y 20 0 1 0.0001 -0.02 0 0
0 S3 50 0 0 -0.00025 0.1 1 -1
1000 X 150 1 0 -0.00025 0.1 0 0
Zj 210000 1000 3000 0.05 40 0 0
Cj - Zj 0 0 -0.05 -40 0 -10000
Note: All Cj - Zj entries are non-positive (for maximization), this means that Table 4 is
already the final (optimum) table.

You might also like