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

In solving the $LP$ problem: "Minimize $z = 6x + 10y$ subject to $x \geq 6, y \geq 2, 2x + y \geq 10, x \geq 0, y \geq 0$." The redundant constraints are $....$

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 $....$

In a linear programming problem $(LPP)$, if the objective function $Z = ax + by$ has the same maximum value at two distinct corner points, then the number of points at which $Z_{max}$ occurs is

The coordinates of the corner points of the bounded feasible region are $(0, 0), (0, 40), (20, 40), (60, 20), (60, 0)$. The maximum of the objective function $z = 40x + 30y$ is . . . . . . .

Value of the objective function $Z = -50x + 20y$ subject to the constraints $2x - y \geq -5$,$3x + y \geq 3$,$2x - 3y \leq 12$,$x \geq 0$,$y \geq 0$. The corner points of the feasible region are $(0, 5)$,$(0, 3)$,$(1, 0)$,and $(6, 0)$. At which point is the value of $Z$ minimum?

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