You are here
Ex 12.1, 2 - Chapter 12 Class 12 Linear Programming
Last updated at July 29, 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
Take a fresh quiz. Then take another.
Every attempt is a new AI-adaptive Teachoo quiz with 5 questions, selected from your answers, mistakes, and progress.
Transcript
Ex 12.1, 2 Solve the following Linear Programming Problems graphically: Minimise Z = – 3x + 4 y subject to x + 2y ≤ 8, 3x + 2y ≤ 12, x ≥ 0, y ≥ 0. Minimize Z = −3x + 4y Subject to x + 2y ≤ 8 3x + 2y ≤ 12 x ≥ 0, y ≥ 0 Hence, Z = –12 is minimum at (4, 0)
