✓ Board-verified
Mathematics · 2026 · 3 marks
CBSE 2026 · Region 4 · Set 1 · Q29
Solve the following Linear Programming Problem graphically: Maximise Z =200 x +120 y subject to the constraints x + y ≤ 300; 3 x + y ≤ 600; x - y…
Solve the following Linear Programming Problem graphically: Maximise $\displaystyle \mathrm{Z}=200 \mathrm{x}+120 \mathrm{y}$ subject to the constraints \[\begin{array}{r} \mathrm{x}+\mathrm{y} \leq 300 \\ 3 \mathrm{x}+\mathrm{y} \leq 600 \\ \mathrm{x}-\mathrm{y} \geq-100 \\ \mathrm{x}, \mathrm{y} \geq 0 \end{array} \]
Marking-scheme solution
| Corner point | Value of Z = 200x + 120y |
| A $\displaystyle (100, 200)$ | $\displaystyle 44000$ |
| B $\displaystyle (150, 150)$ | $\displaystyle 48000$ |
| C $\displaystyle (0, 100)$ | $\displaystyle 12000$ |
| D $\displaystyle (0, 0)$ | $\displaystyle 0$ |
| E $\displaystyle (200, 0)$ | $\displaystyle 40000$ |
All Linear Programming questions2026 question paperNCERT solutions: Linear ProgrammingPractice Linear Programming →
More from Linear Programming
- The corner points of the feasible region in graphical representation of a L. P. P. are (2,72), (15,20) and (40,15). If Z=18 x+9 y be the objective…2025 · asked 2×
- Solve the following linear programming problem graphically: Maximise z=5 x+4 y subject to the constraints x+2 y ≥ 4; 3 x+y ≤ 6; x+y ≤ 4; x, y ≥ 02024
- For the given graph of a Linear Programming Problem, write all the constraints satisfying the given feasible region.2025
- The graph shown below depicts:2025
- The graph shown below depicts:2025
- Solve the following linear programming problem graphically: Minimize Z=13x-15y Subject to constraints x+y ≤ 7; 2 x-3 y+6 ≥ 0; x ≥ 0, y ≥ 02026
- The degree of an objective function of a linear programming problem is2026
- The number of corner points of the feasible region determined by constraints x ≥ 0, y ≥ 0, x+y ≥ 4 is:2024
CBSE Class 12 Mathematics past-paper question from the 2026 board exam, with the answer as CBSE’s own marking scheme gives it. Where our answers come from.