✓ Board-verified
Mathematics · 2025 · 2 marks
Linear ProgrammingLinear Programming Problem and its Mathematical Formulation2 marksApplyvery short answer
CBSE 2025 · Region 7 · Set 2 · Q24
In a Linear Programming Program (LPP) for objective function Z =14 x -10 y subject to constraints x + y ≤ 8; 3 x -2 y ≥-6; x, y ≥ 0 shade the…
In a Linear Programming Program (LPP) for objective function $\displaystyle \mathrm{Z}=14 \mathrm{x}-10 \mathrm{y}$ subject to constraints \[\begin{aligned} & \mathrm{x}+\mathrm{y} \leq 8 \\ & 3 \mathrm{x}-2 \mathrm{y} \geq-6 \\ & \mathrm{x}, \mathrm{y} \geq 0 \end{aligned} \] shade the feasible region and mark the corner points in a neatly drawn graph.
Marking-scheme solution
marking the corner points
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.