For the LP problem,minimize z = 2x + 3y,the c | vedclass

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

Question

(B) To find the minimum value of the objective function $z = 2x + 3y$,we evaluate $z$ at each corner point of the feasible region:$1$. At $A(3, 3): z

Vedclass · Accepted Answer

$15$

Vedclass · Answer

(B) To find the minimum value of the objective function $z = 2x + 3y$,we evaluate $z$ at each corner point of the feasible region:$1$. At $A(3, 3): z = 2(3) + 3(3) = 6 + 9 = 15$$2$. At $B(20, 3): z = 2(20) + 3(3) = 40 + 9 = 49$$3$. At $C(20, 10): z = 2(20) + 3(10) = 40 + 30 = 70$$4$. At $D(18, 12): z = 2(18) + 3(12) = 36 + 36 = 72$$5$. At $E(12, 12): z = 2(12) + 3(12) = 24 + 36 = 60$Comparing these values,the minimum value of $z$ is $15$ at point $A(3, 3)$.

For the $LP$ problem,minimize $z = 2x + 3y$,the coordinates of the corner points of the bounded feasible region are $A(3, 3), B(20, 3), C(20, 10), D(18, 12),$ and $E(12, 12)$. The minimum value of $z$ is:

Similar Questions

Minimize $Z = 13x - 15y$ subject to the constraints: $x + y \leq 7$,$2x - 3y + 6 \geq 0$,$x \geq 0$,$y \geq 0$.

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

Show that the minimum of $Z$ occurs at more than two points.
Maximize $Z = x + y$,subject to $x - y \leq -1$,$-x + y \leq 0$,$x, y \geq 0$.

Maximize and minimize $Z = 3x - 4y$ subject to the constraints $x - 2y \leq 0$,$-3x + y \leq 4$,$x - y \leq 6$,and $x, y \geq 0$.

The coordinates of the corner points of the bounded feasible region are $(0, 10)$,$(5, 5)$,$(15, 15)$,and $(0, 20)$. The minimum value of the objective function $z = 3x + 9y$ is . . . . . . .

Vedclass Test Series

Exam Paper Generator

Online Exam Module