For the following shaded region,the linear constraints are:

  • A
    $x-y \leq 0, -x+3y \leq 3, x \geq 0, y \geq 0$
  • B
    $x-y \geq 0, -x+3y \geq 3, x \geq 0, y \geq 0$
  • C
    $x-y \geq 0, -x+3y \leq 3, x \geq 0, y \geq 0$
  • D
    $x-y \leq 0, -x+3y = 3, x \geq 0, y \geq 0$

Explore More

Similar Questions

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 $.....$

In the following figure, the shaded region represents the system of constraints:

For the feasible region $OCDBO$ shown in the figure,the maximum value of the objective function $z = 3x + 4y$ is:

The graph with the correct feasible region of the $L.P.P.$ for the constraints $2x + y \leqslant 10$,$y \leqslant x$,$y \leqslant 2$,$x, y \geqslant 0$ is $\ldots$

The shaded part of the given figure indicates the feasible region. Then the constraints are

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