CBSE 2023 · Region 1 · Set 3 · Q30 · 3 marks
Solve the following linear programming problem graphically : Maximize $\displaystyle \mathrm{z}=600 \mathrm{x}+400 \mathrm{y}$ subject to the constraints : \[\begin{array}{r} \mathrm{x}+2 \mathrm{y} \leq 12 \\ 2 \mathrm{x}+\mathrm{y} \leq 12 \\ \mathrm{x}+1 \cdot 25 \mathrm{y} \geq 5 \\ \mathrm{x}, \mathrm{y} \geq 0 \end{array} \]
Marking-scheme solution
Corner points Value of Z
$\displaystyle (0,4) \quad 1600$
$\displaystyle (0,6) \quad 2400$
$\displaystyle \begin{array}{ll}(4,4) & 4000 \\
3000\end{array} \rightarrow$ Maximum
$\displaystyle (5,0) \quad 3000$
$\displaystyle (6,0) \quad 3600$
Linear ProgrammingLinear Programming Problem and its Mathematical FormulationApplyshort_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 2023board exam, with the answer as CBSE’s own marking scheme gives it. Where our answers come from.