Slide35.JPG

Slide36.JPG

  1. Chapter 12 Class 12 Linear Programming (Term 1)
  2. Serial order wise

Transcript

Question 11 Corner points of the feasible region determined by the system of linear constraints are (0, 3), (1, 1) and (3, 0). Let Z = px + qy, where p, q > 0. Condition on p and q so that the minimum of Z occurs at (3, 0) and (1, 1) is (A) p = 2q (B) p = ๐‘ž/2 (C) p = 3q (D) p = q Given corner points are (0, 3), (1, 1), (3, 0) Max. Z = px + qy Since maximum value of Z occurs on (3, 0) and (1, 1) Hence, Value on (3, 0) = Value on (1, 1) 3p = p + q 3p โˆ’ p = q 2p = q p = ๐’’/๐Ÿ โˆด Value of Z will be maximum if p = ๐’’/๐Ÿ So, the correct answer is (B)

About the Author

Davneet Singh's photo - Teacher, Engineer, Marketer
Davneet Singh
Davneet Singh is a graduate from Indian Institute of Technology, Kanpur. He has been teaching from the past 10 years. He provides courses for Maths and Science at Teachoo.