✓ Board-verified
Mathematics · 2026 · 1 mark
CBSE 2026 · Region 5 · Set 1 · Q15
The corner points of the feasible region determined by the system of linear constraints are (0, 0), (0, 40), (20, 40) (60, 20) and (60, 0). If the…
The corner points of the feasible region determined by the system of linear constraints are $\displaystyle (0, 0)$, $\displaystyle (0, 40)$, $\displaystyle (20, 40)$ $\displaystyle (60, 20)$ and $\displaystyle (60, 0)$. If the objective function of an LPP is $\displaystyle \mathrm{Z}=4 \mathrm{x}+3 \mathrm{y}$, then the maximum value is :
Official answer
(B)
$\displaystyle 300$
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.