Question 6 (Case Based MCQ) - NCERT Exemplar - MCQs - Chapter 12 Class 12 Linear Programming

Last updated at Dec. 16, 2024 by

The feasible solution for a LPP is shown in Fig. 12.12. Let Z = 3x – 4y be the objective function. (Maximum value of Z + Minimum value of Z) is equal to

(A)13                           (B) 1       

(C) −13                        (D) − 17

This question is similar to Question 38 Choice 2 - Sample Paper 2021 Class 12 - Linear Programming

Linear Programming Class 12 [MCQ] - (Maximum value of Z + Minimum val - NCERT Exemplar - MCQs

part 2 - Question 6 (Case Based MCQ) - NCERT Exemplar - MCQs - Serial order wise - Chapter 12 Class 12 Linear Programming

Share on WhatsApp

Transcript

Question 6 The feasible solution for a LPP is shown in Fig. 12.12. Let Z = 3x – 4y be the objective function. (Maximum value of Z + Minimum value of Z) is equal to 13 (B) 1 (C) −13 (D) − 17 Checking value of Z = 3x – 4y at corner points Thus, Max Z = 15 at (5, 0) Min Z = −32 at (0, 8) Therefore, Maximum value of Z + Minimum value of Z = 15 + (−32) = 15 − 32 = −17 So, the correct answer is (D)

Davneet Singh's photo - Co-founder, Teachoo

Made by

Davneet Singh

Davneet Singh has done his B.Tech from Indian Institute of Technology, Kanpur. He has been teaching from the past 14 years. He provides courses for Maths, Science and Computer Science at Teachoo