Ex 12.1, 10 - Chapter 12 Class 12 Linear Programming
Last updated at Dec. 16, 2024 by Teachoo
Last updated at Dec. 16, 2024 by Teachoo
Ex 12.1, 10 Maximise Z = x + y, subject to x – y ≤ –1, –x + y ≤ 0, x, y ≥ 0. Maximize Z = x + y Subject to x y ≤ –1 –x + y ≤ 0 x, y ≥ 0 As, there is no common region so there is no feasible region. Hence, there is no maximum value of Z.
About the Author
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