✓ Board-verified
Mathematics · 2023 · 5 marks
Linear ProgrammingLinear Programming Problem and its Mathematical Formulation5 marksApplylong answer
CBSE 2023 · Region 5 · Set 3 · Q32
Solve the following Linear Programming Problem graphically: Minimise: Z =60 x +80 y subject to constraints: 3 x +4 y ≥ 8; 5 x +2 y ≥ 11; x, y ≥ 0
Solve the following Linear Programming Problem graphically : Minimise : $\displaystyle \mathrm{Z}=60 \mathrm{x}+80 \mathrm{y}$ subject to constraints : \[\begin{aligned} & 3 \mathrm{x}+4 \mathrm{y} \geq 8 \\ & 5 \mathrm{x}+2 \mathrm{y} \geq 11 \\ & \mathrm{x}, \mathrm{y} \geq 0 \end{aligned} \]
Marking-scheme solution
$\displaystyle Z = 60x + 80y$$\displaystyle Z_B = 0 + 440 = 440$$\displaystyle Z_A = 120 + 40 = 160$$\displaystyle Z_C = 160$Minimum $\displaystyle Z = 160$ at all points of the line ACAll Linear Programming questions2023 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 2023 board exam, with the answer as CBSE’s own marking scheme gives it. Where our answers come from.