The corner points of the bounded feasible region are $(0,0), (2,0), (4,2), (2,4)$ and $(0, \frac{10}{3})$. For the objective function $z = -x + 2y$:
$(i)$ Maximum value of $z$ is at $\ldots \ldots \ldots$
$(ii)$ Minimum value of $z$ is at $\ldots \ldots \ldots$
$(iii)$ The maximum value of $z$ is $\ldots \ldots \ldots$
$(iv)$ The minimum value of $z$ is $\ldots \ldots \ldots$

  • A
    $(i) (2,4), (ii) (0,0), (iii) 6, (iv) 0$
  • B
    $(i) (0, \frac{10}{3}), (ii) (4,2), (iii) 6, (iv) 0$
  • C
    $(i) (2,4), (ii) (2,0), (iii) 6, (iv) -2$
  • D
    $(i) (0, \frac{10}{3}), (ii) (2,0), (iii) \frac{20}{3}, (iv) -2$

Explore More

Similar Questions

Consider a $LPP$ given by minimize $Z = 6x + 10y$. Subject to $x \geq 6, y \geq 2, 2x + y \geq 10, x \geq 0, y \geq 0$. Redundant constraints in this $LPP$ are $....$

The objective function of a Linear Programming Problem $(LPP)$ is

Maximize the function $Z = 11x + 7y$,subject to the constraints:
$x \leq 3, y \leq 2, x \geq 0, y \geq 0$

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:

The coordinates of the corner points of the bounded feasible region are $(0,10), (5,5), (15,15)$,and $(0,20)$. The maximum value of the objective function $Z = 10x + 20y$ 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