Question 10
10. Consider an LPP given as
Max Z = 2x1 - x2 + 2x3
Subject to the constraints
2x1 + x2 ≤ 10
x1 + 2x2 - 2x3 ≤ 20
x1 + 2x3 ≤ 5
x1, x2, x3 ≥ 0
What shall be the solution of the LPP after applying first iteration of the Simplex Method?
Options:
Max Z = 2x1 - x2 + 2x3
Subject to the constraints
2x1 + x2 ≤ 10
x1 + 2x2 - 2x3 ≤ 20
x1 + 2x3 ≤ 5
x1, x2, x3 ≥ 0
What shall be the solution of the LPP after applying first iteration of the Simplex Method?
Previous | Next |
UGC NET CS 2018 July - II Question 9 | UGC NET CS 2018 July - II Question 11 |
Initial simplex table:
(Choose minimum
positive value)
Var.
Here key column is X3 column
and key row is S3 row because it has minimum positive value for θ
So, Key element is 2 that is intersection of X3 column and S3 column
Here, minimum positive value of basic variable is for S3 that is 5/2, hence S3 is the variable that leaves the set of basic variables.
Now, choose maximun value from Ci - Zj row, column X1 and X3 having larger value which is 2 and same in both column. we choose column X3 because it leads to the correct expected solution after first iteration. hence S3 is the variable that enter the set of basic variables.
Simplex table after first iteration :
Here, we perform the row operation : R3 → R3/2 on pivot element
Also, Perform the column operation on R2 : R2 → R2 + 2*R3
Var.
So, now value of the X1 = 0, X2 = 0, X3 = 5/2, S1 = 10, S2 = 25, S3 = 0
After substituting above value in Z = 2x1 - x2 + 2x3
Z = 2x1 - x2 + 2x3
= 2 x 0 - 0 + 2 x (5/2)
= 5
So, Option 2 is the right answer.
Reference Example : THE STEPS OF THE SIMPLEX ALGORITHM
Clear Your Concept using below video reference example of LPP :
Solution of LPP using Simplex Method (maximization problem)