✓ Board-verified
Applied Mathematics · 2026 · 3 marks
CBSE 2026 · Central · Set 4 · Q31
Solve the following Linnear Programming Problem (LPP) graphically: Maximize z =3 x +5 y subject to the constraints: x +2 y ≤ 2000 x + y ≤ 1500 y ≤…
Solve the following Linnear Programming Problem (LPP) graphically :
Maximize $\displaystyle \mathrm{z}=3 \mathrm{x}+5 \mathrm{y}$
subject to the constraints :
$\displaystyle \mathrm{x}+2 \mathrm{y} \leq 2000$
$\displaystyle \mathrm{x}+\mathrm{y} \leq 1500$
$\displaystyle \mathrm{y} \leq 600$
$\displaystyle \mathrm{x} \geq 0, \mathrm{y} \geq 0$
There is no official answer for this question on the site.
More from Linear Programming
- In an LPP, if the objective function Z=ax+by has same maximum value on two corner points of the feasible region, then the number of points at which…2024
- In a LPP, the maximum value of z=3 x+4 y subject to the constraints x+y ≤ 40, x+2 y ≤ 60, x, y ≥ 0 is2025
- The maximum value of the function z=7 x+5 y, subject to the constraints x ≤ 3, y ≤ 2, x ≥ 0, y ≥ 0 is:2026
- The graph of the inequation 2 x+3 y>6 is the:2024
- Region represented by x ≥ 0, y ≥ 0 lies in2023
CBSE Class 12 Applied Mathematics past-paper question from the 2026 board exam. Where our answers come from.