Scribd
Upload
14 views

Simplex Method - Solution 3

Uploaded by

penielcut
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
14 views

Simplex Method - Solution 3

Uploaded by

penielcut
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Max P = 40x1 + 30x2

s.t. constraints
x1 + 2x2 <= 16
x1 + x2 <= 9
3x1 + 2x2 <= 24
x1, x2 >=0

For inequalities of the form (<=), you add slack variables (+s1, +s2, etc.) to convert them
into equalities.

For inequalities of the form (>=), you subtract surplus variables (-s1, -s2, etc.) to convert
them into equalities.

EQUATIONS:

-40x1 – 30x2 + 0s1 + 0s2 + 0s3 = 0


x1 + 2x2 + s1+ 0s2 + 0s3 = 16
x1 + x2 + 0s1 + s2 + 0s3 = 9
3x1 + 2x2 + 0s1 + 0s2 + s3 =24

Note: tableaus inside the dotted rectangle doesn’t have to be shown

Iteration 1

Basic X1 X2 S1 S2 S3 RHS ratio


P -40 -30 0 0 0 0
S1 1 2 1 0 0 16 16/1 = 16
S2 1 1 0 1 0 9 9/1 = 9
S3 3 2 0 0 1 24 24/3 = 8

Basic X1 X2 S1 S2 S3 RHS
P -40 -30 0 0 0 0
S1 1 2 1 0 0 16
S2 1 1 0 1 0 9
X1 1 2/3 0 0 1/3 8
Basic X1 X2 S1 S2 S3 RHS
P -40 – (- -30 – (-40 * 0 – (-40*0) = 0 – (-40*0) = 0 – (-40 * 0 – (-40*8) =
40*1) = 0 2/3) = -10/3 0 0 1/3) = 40/3 320
S1 1 – (1*1) = 2 – (1* 2/3) = 1 – (1*0) = 0 – (1*0) = 0 0 – (1*1/3) = 16 – (1*8) = 8
0 4/3 1 -1/3
S2 1 – (1-1) = 0 1 – (1* 2/3) = 0 – (1*0) = 0 1 – (1*0) = 1 0 – (1* 1/3) 9 – (1*8) = 1
1/3 = -1/3
X1 1 2/3 0 0 1/3 8

Basic X1 X2 S1 S2 S3 RHS
P 0 -10/3 0 0 40/3 320
S1 0 4/3 1 0 -1/3 8
S2 0 1/3 0 1 -1/3 1
X1 1 2/3 0 0 1/3 8

Iteration 2

Basic X1 X2 S1 S2 S3 RHS ratio


P 0 -10/3 0 0 40/3 320
S1 0 4/3 1 0 -1/3 8 8/(4/3) = 6
S2 0 1/3 0 1 -1/3 1 1/(1/3) = 3
X1 1 2/3 0 0 1/3 8 8/(2/3) = 12

Basic X1 X2 S1 S2 S3 RHS
P 0 -10/3 0 0 40/3 320
S1 0 4/3 1 0 -1/3 8
X2 0 1 0 3 -1 3
X1 1 2/3 0 0 1/3 8

Basic X1 X2 S1 S2 S3 RHS

P 0 – (-10/3*0) = -10/3– 0 – (-10/3*0) = 0-(-10/3*3) = 40/3-(-10/3*-1) = 320-(-10/3*3)=


0 (-10/3*1) = 0 0 10/3 10 330

S1 0 – (4/3*0) = 0 4/3 – (4/3*1) = 1 – (4/3*0) = 1 0-(4/3*3)= -4 -1/3-(4/3*-1)= 1 8-(4/3*3)= 4


0

X2 0 1 0 3 -1 3

X1 1–(2/3*0) =1 2/3 – (2/3*1) = 0-(2/3*0) = 0 0-(2/3*3)= -2/3 1/3-(2/3*-1)= 1 8-(2/3*3)= 6


0
Basic X1 X2 S1 S2 S3 RHS
P 0 0 0 10/3 10 330
S1 0 0 1 -4 1 4
X2 0 1 0 3 -1 3
X1 1 0 0 -2/3 1 6

Since P row has no more negative values, the solution is optimal.

P = 330; the maximum value of P, or profit, is 330.


x1 = 6
x2 = 3

S1=4; meaning 4 units of resource were unused in the first constraint, while S2 and S3 are
zero, meaning the second and third constraints were fully utilized.

NOTES:

• Maximization Problem: Make all coefficients in Z negative if they aren't already.


• Minimization Problem: Always negate the coefficients of Z to convert it into
maximization form. If all variables are already negative, just leave them as is.

• If all ratios are negative or zero, the problem has no feasible solution.

• If the pivot element is 0, it usually means the solution is infeasible or the problem is
not set up correctly.

• After solving a minimization problem, negate the result to get the actual minimum
value. (ex: if you got 500 as your final answer using simplex method, the answer will
be -500)

You might also like