CBSE 2024 · Region 4 · Set 3 · Q30 · 3 marks
The corner points of the feasible region determined by the system of linear constraints are as shown in the following figure:
(i)If $\displaystyle \mathrm{Z}=3 x-4 y$ be the objective function, then find the maximum value of Z .(ii)If $\displaystyle \mathrm{Z}=\mathrm{p} x+\mathrm{qy}$ where $\displaystyle \mathrm{p}, \mathrm{q}>0$ be the objective function. Find the condition on $\displaystyle \mathrm{p}$ and $\displaystyle \mathrm{q}$ so that maximum value of $\displaystyle \mathrm{Z}$ occurs at $\displaystyle B(4,10)$ and $\displaystyle C(6,8)$.
The corner points of the feasible region determined by the system of linear constraints are as shown in the following figure:
(i)
If $\displaystyle \mathrm{Z}=3 x-4 y$ be the objective function, then find the maximum value of Z .
(ii)
If $\displaystyle \mathrm{Z}=\mathrm{p} x+\mathrm{qy}$ where $\displaystyle \mathrm{p}, \mathrm{q}>0$ be the objective function. Find the condition on $\displaystyle \mathrm{p}$ and $\displaystyle \mathrm{q}$ so that maximum value of $\displaystyle \mathrm{Z}$ occurs at $\displaystyle B(4,10)$ and $\displaystyle C(6,8)$.
Marking-scheme solution
| corner points | $\displaystyle \mathrm{Z}=3 x-4 y$ | |
| \cline { $\displaystyle 1$ - $\displaystyle 1$ }$\displaystyle A(0,8)$ | -$\displaystyle 32$ | |
| $\displaystyle B(4,10)$ | -$\displaystyle 28$ | |
| $\displaystyle C(6,8)$ | -$\displaystyle 14$ | |
| $\displaystyle D(6,5)$ | -$\displaystyle 2$ | |
| $\displaystyle E(4,0)$ | $\displaystyle 12$ (Maximum) | |
| $\displaystyle O(0,0)$ | $\displaystyle 0$ |
Maximum value of Z is $\displaystyle 12$ at E when $\displaystyle x=4, y=0$
(ii)
$\displaystyle \mathrm{Z}_{B}=\mathrm{Z}_{C} \Rightarrow 4 \mathrm{p}+10 \mathrm{q}=6 \mathrm{p}+8 \mathrm{q}$ Thus, $\displaystyle \mathrm{p}=\mathrm{q}$
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 2024board exam, with the answer as CBSE’s own marking scheme gives it. Where our answers come from.