The shaded region in the following figure is the solution set of the inequations:

  • A
    $x+2y \geq 50, 2x+y \leq 100, 2x-y \leq 0, x, y \geq 0$
  • B
    $x+2y \leq 50, 2x+y \leq 100, 2x-y \leq 0, x, y \geq 0$
  • C
    $x+2y \geq 50, 2x+y \geq 100, 2x-y \leq 0, x, y \geq 0$
  • D
    $x+2y \leq 50, 2x+y \geq 100, 2x-y \leq 0, x, y \geq 0$

Explore More

Similar Questions

The shaded area in the figure given below is a solution set of a system of inequations. The minimum value of the objective function $Z = 3x + 5y$,subject to the linear constraints given by this system of inequations,is:

Solve the following linear programming problem graphically:
Maximise $Z = 4x + y$......$(1)$
subject to the constraints:
${x + y \leqslant 50}$.......$(2)$
${3x + y \leqslant 90}$......$(3)$
${x \geqslant 0, y \geqslant 0}$......$(4)$

Find the point at which the objective function $Z = x + y$ attains its maximum value subject to the constraints $x + 2y \leq 70$, $2x + y \leq 95$, $x \geq 0$, and $y \geq 0$.

Solution of the following $LP$ problem
Minimize $z = -3x + 2y$
subject to $0 \leq x \leq 4, 1 \leq y \leq 6, x + y \leq 5$ is $.....$

One kind of cake requires $200 \,g$ of flour and $25 \,g$ of fat,and another kind of cake requires $100 \,g$ of flour and $50 \,g$ of fat. Find the maximum number of cakes which can be made from $5 \,kg$ of flour and $1 \,kg$ of fat,assuming that there is no shortage of the other ingredients used in making the cakes.

Difficult
View Solution

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo