CBSE 2026 · Region 3 · Set 3 · Q34 · 5 marks
Solve the following Linear Programming Problem graphically : \[\text { Maximize } \mathrm{Z}=8 \mathrm{x}+8 \mathrm{y} \] subject to the constraints \[\begin{array}{r} \mathrm{x}-20 \leq 0 \\ 2 \mathrm{x}+3 \mathrm{y} \leq 120 \\ 2 \mathrm{x}+\mathrm{y} \leq 60 \\ \mathrm{x} \geq 0, \mathrm{y} \geq 0 \end{array} \]
Marking-scheme solution
| Corner Points | Value of Z = 8x + 8y |
| $\displaystyle (20, 0)$ | $\displaystyle 160$ |
| $\displaystyle (20, 20)$ | $\displaystyle 320$ |
| $\displaystyle (15, 30)$ | $\displaystyle 360$ |
| $\displaystyle (0, 40)$ | $\displaystyle 320$ |
| $\displaystyle (0, 0)$ | $\displaystyle 0$ |
Linear ProgrammingLinear Programming Problem and its Mathematical FormulationApplylong_answermedium
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…2025 · asked 6×
- Solve the following linear programming problem graphically: Minimize Z=13x-15y Subject to constraints2026 · asked 3×
- The degree of an objective function of a linear programming problem is2026 · asked 3×
- The number of corner points of the feasible region determined by constraints x ≥ 0, y ≥ 0, x+y ≥ 4 is:2024 · asked 3×
- The corner points of the feasible region of a Linear Programming Problem are (0,2),(3,0),(6,0),(6,8) and…2025 · asked 3×
- For a Linear Programming Problem (LPP), the given objective function Z=3 x+2 y is subject to constraints: The…2025 · asked 3×
- Assertion: The shaded portion of the graph represents the feasible region for the given Linear Programming…2025 · asked 3×
- A factory produces two products X and Y. The profit earned by selling X and Y is represented by the objective…2025 · asked 3×
CBSE Class 12 Mathematics past-paper question from the 2026board exam, with the answer as CBSE’s own marking scheme gives it. Where our answers come from.