The solution set of the constraints $x + 2y \geq 11$,$3x + 4y \leq 30$,$2x + 5y \leq 30$,$x \geq 0$,$y \geq 0$ includes the point:

  • A
    $(2, 3)$
  • B
    $(3, 2)$
  • C
    $(3, 4)$
  • D
    $(4, 3)$

Explore More

Similar Questions

Solve the Linear Programming Problem graphically:
Maximise $Z = 5x + 3y$
subject to the constraints:
$3x + 5y \leq 15$
$5x + 2y \leq 10$
$x \geq 0, y \geq 0$

If an $LPP$ admits an optimal solution at two consecutive vertices of a feasible region,then:

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:

The corner points of the feasible region determined by the system of linear constraints are $(0,10), (10,15), (15,25), (0,30)$. Let $z = px + qy$,where $p, q > 0$. The condition on $p$ and $q$ so that the maximum of $z$ occurs at both the points $(15,25)$ and $(0,30)$ is . . . . . . .

Let $x$ and $y$ be optimal solutions of a Linear Programming $(LP)$ problem. Then,which of the following is true?

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