You are here
Example 1 - 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
Example 1 Solve the following linear programming problem graphically: Maximise Z = 4x + y subject to the constraints: x + y ≤ 50 3x + y ≤ 90 x ≥ 0, y ≥ 0 Maximize Z = 4x + y Subject to x + y ≤ 50 3x + y ≤ 90 x ≥ 0, y ≥ 0 ∴ Z is maximum at (30, 0)
