✓ Board-verified
Mathematics · 2026 · 5 marks
Linear ProgrammingLinear Programming Problem and its Mathematical Formulation5 marksApplylong answer
CBSE 2026 · Region 3 · Set 2 · Q35
Solve the following Linear Programming Problem graphically: Maximise Z =12 x +18 y subject to the constraints x + y ≤ 1200; x -2 y ≥ 0; x +3 y ≥ 600;…
Solve the following Linear Programming Problem graphically : Maximise $\displaystyle \mathrm{Z}=12 \mathrm{x}+18 \mathrm{y}$ subject to the constraints \[\begin{array}{r} \mathrm{x}+\mathrm{y} \leq 1200 \\ \mathrm{x}-2 \mathrm{y} \geq 0 \\ \mathrm{x}+3 \mathrm{y} \geq 600 \\ \mathrm{x} \geq 0, \mathrm{y} \geq 0 \end{array} \]
Marking-scheme solution
| Corner Points | Value of Z = 12x + 18y |
| A $\displaystyle (600, 0)$ | $\displaystyle 7200$ |
| B $\displaystyle (1200, 0)$ | $\displaystyle 14400$ |
| C $\displaystyle (800, 400)$ | $\displaystyle 16800$ |
| D $\displaystyle (240, 120)$ | $\displaystyle 5040$ |
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.