✓ Board-verified↻ asked 2×
Mathematics · 2025 · 1 mark
CBSE 2025 · Region 1 · Set 2 · Q17
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…
The corner points of the feasible region in graphical representation of a L. P. P. are $\displaystyle (2,72)$, $\displaystyle (15,20)$ and $\displaystyle (40,15)$. If $\displaystyle \mathrm{Z}=18 x+9 \mathrm{y}$ be the objective function, then
Official answer
(C)
Z is maximum at $\displaystyle (40,15)$, minimum at $\displaystyle (15,20)$
Asked in 2 different years
- 2023 · Region 1 · Set 1 · Q17
- 2023 · Region 1 · Set 2 · Q13
- 2023 · Region 1 · Set 3 · Q8
- 2025 · Region 1 · Set 1 · Q14
- 2025 · Region 1 · Set 2 · Q17
- 2025 · Region 1 · Set 3 · Q15
All Linear Programming questions2025 question paperNCERT solutions: Linear ProgrammingPractice Linear Programming →
More from Linear Programming
- 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
- The corner points of the feasible region of a Linear Programming Problem are (0,2),(3,0),(6,0),(6,8) and (0,5). If Z=ax+by;(a, b>0) be the objective…2025
Asked in 2023 & 2025. CBSE Class 12 Mathematics past-paper question from the 2025 board exam, with the answer as CBSE’s own marking scheme gives it. Where our answers come from.