The corner points of the bounded feasible reg | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(B) To find the maximum and minimum values of the objective function $Z = 3x - y$,we evaluate $Z$ at each corner point of the feasible region:						Co

Vedclass · Accepted Answer

$(i) (0,7), (ii) (6,0), (iii) 18, (iv) -7$

Vedclass · Answer

(B) To find the maximum and minimum values of the objective function $Z = 3x - y$,we evaluate $Z$ at each corner point of the feasible region:						Corner Point $(x, y)$			Value of $Z = 3x - y$							$(0, 1)$			$Z = 3(0) - 1 = -1$							$(0, 7)$			$Z = 3(0) - 7 = -7$ (Minimum)							$(2, 7)$			$Z = 3(2) - 7 = -1$							$(6, 3)$			$Z = 3(6) - 3 = 15$							$(6, 0)$			$Z = 3(6) - 0 = 18$ (Maximum)							$(1, 0)$			$Z = 3(1) - 0 = 3$			From the table,we observe:$(i)$ $Z$ is minimum at $(0, 7)$.$(ii)$ $Z$ is maximum at $(6, 0)$.$(iii)$ The maximum value of $Z$ is $18$.$(iv)$ The minimum value of $Z$ is $-7$.Thus,the correct option is $B$.

Similar Questions

The corner points of the feasible region determined by the system of linear constraints are $(0, 10)$, $(5, 5)$, $(15, 15)$, and $(0, 20)$. Let $z = px + qy$ where $p, q > 0$. The condition on $p$ and $q$ such that the maximum value of $z$ occurs at both points $(15, 15)$ and $(0, 20)$ is

The feasible region for a $LPP$ is shown in the figure. Find the minimum value of $Z=11x+7y$.

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

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 feasible region for a $LPP$ is shown in the following figure. Evaluate $Z = 4x + y$ at each of the corner points of this region. Find the minimum value of $Z$,if it exists.

Vedclass Test Series

Exam Paper Generator

Online Exam Module

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$