Question 10 (Case Based MCQ) - NCERT Exemplar - MCQs - Chapter 12 Class 12 Linear Programming (Term 1)

Last updated at Nov. 19, 2021 by Teachoo

Hello! Teachoo has made this answer with days (even weeks!) worth of effort and love. If Teachoo has been of any help to you in your Board exam preparation, then please support us by clicking on this link to make a donation

Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5).

Hello! Teachoo has made this answer with days (even weeks!) worth of effort and love. If Teachoo has been of any help to you in your Board exam preparation, then please support us by clicking on this link to make a donation

Question 10
Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5).
Let F = 4x + 6y be the objective function.
Maximum of F – Minimum of F =
60 (B) 48
(C) 42 (D) 18
We need to find Max and Min F = 4x + 6y
Corner Points are
(0, 2), (3, 0), (6, 0), (6, 8), (0, 5)
Checking value of F at corner points
Thus,
Max Z = 72
Min Z = 12
Therefore,
Max value of Z − Min value of Z = 72 − 12
= 60
So, the correct answer is (D)

Made by

Davneet Singh

Davneet Singh is a graduate from Indian Institute of Technology, Kanpur. He has been teaching from the past 12 years. He provides courses for Maths and Science at Teachoo.