The solution set of the constraints $x+2y \leq 2000$,$x+y \leq 1500$,$y \leq 600$ and $x \geq 0$ does not include the point

  • A
    $(1000, 0)$
  • B
    $(0, 500)$
  • C
    $(2, 0)$
  • D
    $(2000, 0)$

Explore More

Similar Questions

For the following shaded region,the linear constraints are:

The solution of the linear programming problem,maximize $Z = 3x_{1} + 5x_{2}$ subject to $3x_{1} + 2x_{2} \leq 18$,$x_{1} \leq 4$,$x_{2} \leq 6$,$x_{1} \geq 0$,$x_{2} \geq 0$ is:

Difficult
View Solution

The maximum value of the objective function $z=4x+5y$ subject to the constraints $2x+3y \leq 12$,$2x+y \leq 8$ and $x \geq 0, y \geq 0$ is:

The difference between the maximum value and the minimum value of the objective function $z = 3x + y$ subject to the constraints $2x + 3y \leq 6$, $x + y \geq 1$, $x \geq 0$, $y \geq 0$ is....

The feasible region of the $L$.$P$.$P$. (Linear Programming Problem) to maximize $z = 70x + 50y$ subject to the constraints $8x + 5y \leq 60$,$4x + 5y \leq 40$ and $x \geq 0, y \geq 0$ is:

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