The feasible solution for a LPP is shown in t | vedclass

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

Question

(A) To find the maximum value of the objective function $z=3x-4y$,we evaluate $z$ at each corner point of the feasible region shown in the figure.Corn

Vedclass · Accepted Answer

$(5,0)$

Vedclass · Answer

(A) To find the maximum value of the objective function $z=3x-4y$,we evaluate $z$ at each corner point of the feasible region shown in the figure.Corner PointObjective Function $z=3x-4y$$(0,0)$$z=3(0)-4(0)=0$$(5,0)$$z=3(5)-4(0)=15$ (Maximum)$(6,5)$$z=3(6)-4(5)=18-20=-2$$(6,8)$$z=3(6)-4(8)=18-32=-14$$(4,10)$$z=3(4)-4(10)=12-40=-28$$(0,8)$$z=3(0)-4(8)=-32$The maximum value of the objective function $z=3x-4y$ is $15$,which occurs at the point $(5,0)$.

The feasible solution for a $LPP$ is shown in the figure. Let $z=3x-4y$ be the objective function. The maximum value of $Z$ occurs at $......$

Similar Questions

The minimum value of $Z = 2x + 3y$ for the system of linear constraints: $2x + 4y \leq 12$,$x + y \leq 3$,$x \geq 0$,and $y \geq 0$ is . . . . . . .

If $x+y \leq 2, x \geq 0, y \geq 0$,the point at which the maximum value of $3x+2y$ is attained will be:

$z = 30x - 30y + 1800$ is an objective function. The corner points of the feasible region are $(15, 0), (15, 15), (10, 20), (0, 20),$ and $(0, 15)$. $z$ has the minimum value at $\ldots$ point.

The objective function of a Linear Programming Problem $(LPP)$ defined over a convex set attains its optimum value at:

The feasible solution for a $LPP$ is shown in the figure. Let $z=3x-4y$ be the objective function. The minimum value of $z$ occurs at:

Vedclass Test Series

Exam Paper Generator

Online Exam Module