CBSE 2026 · Region 1 · Set 1 · Q30 · 3 marks
Solve the following linear programming problem graphically :
Minimize $\displaystyle \mathrm{Z}=13x-15y$
Subject to constraints \[\begin{aligned} & x+y \leq 7 \\ & 2 x-3 y+6 \geq 0 \\ & x \geq 0, y \geq 0 \end{aligned} \]
Official answer
From CBSE’s own marking scheme for this paper.
Minimum value of Z = -$\displaystyle 15$, occurring at the point $\displaystyle (0,1)$
Marking-scheme solution
| Corner point | Value of $\displaystyle Z = 13x - 15y$ |
| $\displaystyle (0, 0)$ | $\displaystyle 0$ |
| $\displaystyle (7, 0)$ | $\displaystyle 91$ |
| $\displaystyle (3, 4)$ | $\displaystyle -21$ |
| $\displaystyle (0, 2)$ | $\displaystyle -30$ |
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×
- 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×
- 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 2026board exam, with the answer as CBSE’s own marking scheme gives it. Where our answers come from.