✓ Board-verified
Mathematics · 2025 · 1 mark
CBSE 2025 · Region 4 · Set 1 · Q18
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…
The corner points of the feasible region of a Linear Programming Problem are $\displaystyle (0,2),(3,0),(6,0),(6,8)$ and $\displaystyle (0,5)$. If $\displaystyle \mathrm{Z}=\mathrm{ax}+\mathrm{by} ;(\mathrm{a}, \mathrm{b}>0)$ be the objective function, and maximum value of Z is obtained at $\displaystyle ( 0,2 )$ and $\displaystyle (3,0)$, then the relation between a and b is :
Official answer
(D)
$\displaystyle 3 \mathrm{a}=2 \mathrm{~b}$
All Linear Programming questions2025 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 2025 board exam, with the answer as CBSE’s own marking scheme gives it. Where our answers come from.