Answer available
Class 12 · Mathematics · Linear Programming
Maximise Z = 3x + 4y subject to x + y ≤ 4, x ≥ 0 and y ≥ 0.
4 marksHardApplication based
Class 12 · ICSE · Mathematics
Linear Programming
Formulating a linear programming problem and solving it graphically in two variables.
- Questions
- 4
- PYQs
- 0
- Topics
- 0
Syllabus mapping: ISC syllabus (CISCE)
Questions
4 questions in this chapter.
- 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