CBSE 2025 · Region 7 · Set 3 · Q24 · 2 marks
For a Linear Programming Problem, find min $\displaystyle \mathrm{Z}=5 \mathrm{x}+3 \mathrm{y}$ (where Z is the objective function) for the feasible region shaded in the given figure.
(Note : The figure is not to scale)
(Note : The figure is not to scale)Marking-scheme solution
| Corner Points | Value of $\displaystyle \mathbf{Z}=\mathbf{5 x}+\mathbf{3 y}$ |
| $\displaystyle \mathbf{A}(\mathbf{3}, \mathbf{2})$ | $\displaystyle \mathbf{2 1}$ |
| $\displaystyle \mathbf{B}(\mathbf{0}, \mathbf{5})$ | $\displaystyle \mathbf{1 5}$ |
| $\displaystyle \mathbf{C}(\mathbf{0}, \mathbf{3})$ | $\displaystyle \mathbf{9}$ |
Linear ProgrammingLinear Programming Problem and its Mathematical FormulationApplyvery_short_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 2025board exam, with the answer as CBSE’s own marking scheme gives it. Where our answers come from.