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 objective function of a Linear Programming Problem $(LPP)$ defined over a convex set attains its optimum value at:

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:

Determine graphically the minimum value of the objective function
$Z = -50x + 20y$ .....$(1)$
subject to the constraints:
${2x - y \geqslant -5}$ .....$(2)$
${3x + y \geqslant 3}$ .....$(3)$
${2x - 3y \leqslant 12}$ .....$(4)$
${x \geqslant 0, y \geqslant 0}$ .....$(5)$

Determine the maximum value of $Z=11 x+7 y$ subject to the constraints:
$2 x+y \leq 6, x \leq 2, x \geq 0, y \geq 0$

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