UGC-NET | UGC-NET CS 2017 Nov – III | Question 69

Consider the following LPP :

Min Z = 2x1 + x2 + 3x3

Subject to :

x1 − 2x2 + x3 ≥ 4
2x1 + x2 + x3 ≤ 8
x1 − x3 ≥ 0
x1, x2, x3 ≥ 0

The solution of this LPP using Dual Simplex Method is :
(A) x1=0, x2=0, x3=3 and Z=9
(B) x1=0, x2=6, x2=0 and Z=6
(C) x1=4, x2=0, x2=0 and Z=8
(D) x1=2, x2=0, x2=2 and Z=10


Answer: (C)

Explanation:

Quiz of this Question



My Personal Notes arrow_drop_up


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.