The solution for minimizing the function $z = x + y$ under an $L$.$P$.$P$. with constraints $x + y \geqslant 2$,$x + 2y \leqslant 8$,$y \leqslant 3$,$x, y \geqslant 0$ is

  • A
    at the point $(0, 2)$
  • B
    at the point $(2, 0)$
  • C
    at infinite number of points on the line segment joining $(0, 2)$ and $(2, 0)$
  • D
    at the point $(0, 3)$

Explore More

Similar Questions

Determine the maximum value of $Z=3x+4y$ if the feasible region (shaded) for a $LPP$ is shown in the adjacent figure.

Minimise $Z = 3x + 2y$ subject to the constraints:
$x + y \geqslant 8$ ... $(1)$
$3x + 5y \leqslant 15$ ... $(2)$
$x \geqslant 0, y \geqslant 0$ ... $(3)$

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 of an $LPP$ are $(0,2), (3,0), (6,0), (6,8)$ and $(0,5)$. Then the minimum value of $z = 4x + 6y$ occurs at:

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