Answer available
Class 12 · Mathematics · Linear Programming
Maximise Z = 3x + 4y subject to x + y ≤ 4, x ≥ 0 and y ≥ 0.
4 marksHardApplication based
ICSE question bank
Every question in the vault, filterable by class, subject, chapter, topic, year, marks, difficulty, type and source. The filters live in the URL, so any view you build can be shared.
4 questions
- Answer available
Class 12 · Mathematics · Linear Programming
Minimise Z = 5x + 10y subject to x + 2y ≤ 120, x + y ≥ 60, x − 2y ≥ 0 and x, y ≥ 0.
4 marksHardApplication based
- Answer available
Class 12 · Mathematics · Linear Programming
Define a convex feasible region and state why the optimum of a linear objective function occurs at a corner point.
3 marksMediumShort answer
- Answer available
Class 12 · Mathematics · Linear Programming
Define the feasible region and the objective function of a linear programming problem, and state where the optimum occurs.
3 marksMediumShort answer