The corner points of the bounded feasible region are $(0,1), (0,7), (2,7), (6,3), (6,0), (1,0)$. For the objective function $Z = 3x - y$:
$(i)$ At which point is $Z$ minimum?
$(ii)$ At which point is $Z$ maximum?
$(iii)$ The maximum value of $Z$ is $\ldots$
$(iv)$ The minimum value of $Z$ is $\ldots$

  • A
    $(i) (2,7), (ii) (6,3), (iii) 20, (iv) -1$
  • B
    $(i) (0,7), (ii) (6,0), (iii) 18, (iv) -7$
  • C
    $(i) (0,1), (ii) (6,3), (iii) 18, (iv) -1$
  • D
    $(i) (0,7), (ii) (6,0), (iii) 15, (iv) -7$

Explore More

Similar Questions

The shaded region in the given figure is a graph of $.....$

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:

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

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

The linear programming problem $(LPP)$ to maximize $z = 2x + 5y$ subject to the constraints $x + 3y \leq 6$, $2x + 6y \leq 18$, $x \geq 0$, and $y \geq 0$ has:

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