CBSE 2025 · Region 5 · Set 3 · Q19 · 1 mark
Assertion (A) : The shaded portion of the graph represents the feasible region for the given Linear Programming Problem (LPP).
$\displaystyle \operatorname{Min} \mathrm{Z}=50 \mathrm{x}+70 \mathrm{y}$ subject to constraints $\displaystyle 2 \mathrm{x}+\mathrm{y} \geq 8, \mathrm{x}+2 \mathrm{y} \geq 10, \mathrm{x}, \mathrm{y} \geq 0$ $\displaystyle \mathrm{Z}=50 \mathrm{x}+70 \mathrm{y}$ has a minimum value $\displaystyle =380$ at $\displaystyle \mathrm{B}(2,4)$.
Reason (R): The region representing $\displaystyle 50 \mathrm{x}+70 \mathrm{y}<380$ does not have any point common with the feasible region.
Official answer
From CBSE’s own marking scheme for this paper.
(A)
Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of the Assertion (A).
Linear ProgrammingLinear Programming Problem and its Mathematical FormulationAnalyseassertion_reasonmedium
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×
- A factory produces two products X and Y. The profit earned by selling X and Y is represented by the objective…2025 · asked 3×
- Which of the following points satisfies both the inequations 2 x+y ≤ 10 and x+2 y ≥ 8?2023 · asked 3×
CBSE Class 12 Mathematics past-paper question from the 2025board exam, with the answer as CBSE’s own marking scheme gives it. Where our answers come from.