Feasible region (shaded) for a LPP is shown in the Fig. 12.6. Minimum of Z = 4x + 3y occurs at the point
(A) (0, 8) (B) (2, 5)
(C) (4, 3) (D) (9, 0)
This question is similar to Ex 12.2, 1 - Chapter 12 Class 12 - Linear Programming
NCERT Exemplar - MCQs
Question 2 Important You are here
Question 3
Question 4 (Case Based MCQ)
Question 5 (Case Based MCQ)
Question 6 (Case Based MCQ) Important
Question 7 (Case Based MCQ) Important
Question 8 (Case Based MCQ) Important
Question 9 (Case Based MCQ) Important
Question 10 (Case Based MCQ)
Question 11 Important
NCERT Exemplar - MCQs
Last updated at Nov. 20, 2021 by Teachoo
This question is similar to Ex 12.2, 1 - Chapter 12 Class 12 - Linear Programming
Question 2 Feasible region (shaded) for a LPP is shown in the Fig. 12.6. Minimum of Z = 4x + 3y occurs at the point (A) (0, 8) (B) (2, 5) (C) (4, 3) (D) (9, 0) Corners points are (0, 8), (2, 5), (4, 3) and (9, 0) We need to Minimise Z = 4x + 3y Checking value of Z at all corner points Since the feasible region is unbounded, Hence, 23 may or may not be the minimum value of Z So, we need to graph inequality : Z < 23 4x + 3y < 23 As, there is no common points between the feasible region and the inequality. ∴ Min Z = 23 at (2, 5) So, the correct answer is (B)