You are here
Ex 12.1, 10 - Chapter 12 Class 12 Linear Programming
Last updated at Dec. 16, 2024 by Teachoo
Linear equations given - Not feasible
Chapter 12 Class 12 Linear Programming
Concept wise
- Linear equations given - Bounded
-
Linear equations given - Not feasible
- Linear equations given - Unbounded
- Diet problems
- Manufacturing problems
- Other questions
- Transport problems
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.
