The feasible region for LPP is shown shaded in the adjacent figure. The minimum value of objective function \(Z=2x+y\) is :
(Given: A = (8, 0), B = (6, 1), C = (1, 6), D = (0, 9))
Answer & explanation
Correct answer: option 1
The correct answer is Option (1) → 8
By the corner point method, Z = 2x + y at the corners of the shaded region:
\(Z(A) = Z(8, 0) = 16\)
\(Z(B) = Z(6, 1) = 13\)
\(Z(C) = Z(1, 6) = 8\)
\(Z(D) = Z(0, 9) = 9\)
The smallest corner value is 8, at C. The region is unbounded, so it must be checked that no point of the region gives Z < 8. The two edges through C are the line through C and B and the line through C and D:
\(\text{edge CB: } x + y = 7\)
\(\text{edge CD: } 3x + y = 9\)
Every point of the shaded region satisfies \(x + y \ge 7\) and \(3x + y \ge 9\). Adding the two:
\(4x + 2y \ge 16\)
\(2x + y \ge 8\)
So Z is never below 8 on the region, and the minimum value of Z is 8.