In the given graph, the feasible region for a LPP is shaded. The objective function Z = 2x – 3y, will be minimum at:
(a) (4, 10) (b) (6, 8)
(c) (0, 8) (d) (6, 5)
Something went wrong!
The
video
couldn't load due to a technical hiccup.
But don't worry — our team is already on it, and we're working hard to get it back up ASAP.
Thanks for bearing with us!