You are here
Ex 12.1, 7 - Chapter 12 Class 12 Linear Programming
Last updated at July 14, 2026 by Teachoo
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, 7 Minimise and Maximise Z = 5x + 10 y subject to x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x, y ≥ 0. Minimize & Maximize Z = 5x + 10y Subject to, x + 2y ≤ 120 x + y ≥ 60 x − 2y ≥ 0 x, y, ≥ 0 ∴ Z = 300 is minimum at (60, 0) Also, Z is maximum at two points (60, 30) & (120, 0) ∴ Z = 600 is maximum at all points joining (60, 30) & (120, 0)
