Consider the following LPP : Min Z = 2x1 + x2 + 3x3 Subject to : x1 − 2x2 + x3 ≥ 4 2x1 + x2 + x3 ≤ 8 x1…
Multiplying the first constraint by 2 gives \(2x_1 - 4x_2 + 2x_3 \ge 8\), so \(Z = (2x_1 - 4x_2 + 2x_3) + 5x_2 + x_3 \ge 8\) at every feasible point. The point (4, 0, 0)…
Choose your answer
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 :
Answer and explanation
Correct answer C
Multiplying the first constraint by 2 gives , so at every feasible point. The point (4, 0, 0) satisfies all three constraints (4 ≥ 4, 8 ≤ 8 and 4 ≥ 0) and gives Z = 8, so it is optimal. The points (0, 0, 3) and (0, 6, 0) break the first constraint, and (2, 0, 2) is feasible but gives Z = 10.
Practice for these exams
-
UGC NET Computer Science and Applications