CBSE 2024 · Region 3 · Set 1 · Q30 · 3 marks
Solve the following linear programming problem graphically: Maximise $\displaystyle \mathrm{z}=4 \mathrm{x}+3 \mathrm{y}$, subject to the constraints \[\begin{aligned} & \mathrm{x}+\mathrm{y} \leq 800 \\ & 2 \mathrm{x}+\mathrm{y} \leq 1000 \\ & \mathrm{x} \leq 400 \\ & \mathrm{x}, \mathrm{y} \geq 0 \end{aligned} \]
Marking-scheme solution
| Corner Point | Value of $\displaystyle z = 4x + 3y$ |
| $\displaystyle O(0,0)$ | $\displaystyle 0$ |
| $\displaystyle A(400,0)$ | $\displaystyle 1600$ |
| $\displaystyle B(400,200)$ | $\displaystyle 2200$ |
| $\displaystyle C(200,600)$ | $\displaystyle 2600$ |
| $\displaystyle D(0,800)$ | $\displaystyle 2400$ |
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.