Ex 12.1, 10 - Chapter 12 Class 12 Linear Programming

Last updated at April 16, 2024 by

Ex 12.1, 10 - Maximise Z = x + y subject to x - y < -1 - Ex 12.1 Ex 12.1, 10 - Chapter 12 Class 12 Linear Programming - Part 2

You saved atleast 2 minutes of distracting ads by going ad-free. Thank you :)

You saved atleast 2 minutes by viewing the ad-free version of this page. Thank you for being a part of Teachoo Black.

Transcript

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.

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