Graphical Method of Solving Linear Programming Problems
If Z = x + 2y...
Question
If Z=x+2y, subject to the constraints: 2x+y≥3,x+2y≥6,x,y≥0, then the minimum of Z occurs at
A
only one point
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
two points
No worries! We‘ve got your back. Try BYJU‘S free classes today!
C
more than two points
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
D
minimum of Z is not possible
No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution
The correct option is C more than two points The feasible region under the given constraints is
The coordinates of corner points and values of Z are
Corner points
Z=x+2y
(0,3)
6
(6,0)
6
From the above table minimum value of Z=6
Now, compare the constraints and objective function.
We observe that the slope of the constraint (x+2y≥6) and objective function is same, so Z will be minimum at all the points which lie on the constraint line (x+2y=6) between the points (0,3) and (6,0).