In a Linear Programming Problem ($L$.$P$.$P$.), the corner points of the feasible region defined by the constraints $3x - y \geq 6$, $x \leq 3$, $y \leq 2$, $y \geq 0$, and $x \geq 0$ are:

  • A
    $(3, 2), (3, 0), (2, 0)$
  • B
    $(\frac{8}{3}, 2), (3, 2), (3, 0), (2, 0)$
  • C
    $(0, 0), (2, 0), (\frac{8}{3}, 2), (0, 2)$
  • D
    $(3, 2), (0, 3), (0, 2)$

Explore More

Similar Questions

Show that the minimum of $Z$ occurs at more than two points.
Minimise and Maximise $Z = 5x + 10y$
subject to $x + 2y \leq 120, x + y \geq 60, x - 2y \geq 0, x, y \geq 0$.

The corner points of the feasible region determined by the system of linear constraints are $(2, 72)$,$(15, 20)$,and $(40, 15)$. Let $Z = 6x + 3y$ be the objective function. The minimum value of $Z$ occurs at:

For a linear programming problem,the objective function is $Z = 3x + 2y$. If the corner points of the bounded feasible region are $(12, 0)$,$(4, 2)$,$(1, 5)$,and $(1, 10)$,then the maximum value of $Z$ is . . . . . . .

The constraints $-x+y \leq 1, -x+3y \leq 9, x \geq 0, y \geq 0$ define a:

The feasible region for an $LPP$ is shown in the figure. Let $z=3x-4y$ be the objective function. The maximum value of $z$ 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