Determine graphically the minimum value of th | vedclass

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

Question

(D) First,we graph the feasible region of the system of inequalities $(2)$ to $(5)$.The feasible region is unbounded as shown in the figure.We evaluat

Vedclass · Accepted Answer

No minimum value

Vedclass · Answer

(D) First,we graph the feasible region of the system of inequalities $(2)$ to $(5)$.The feasible region is unbounded as shown in the figure.We evaluate $Z$ at the corner points:Corner Point$Z = -50x + 20y$$(0, 5)$$100$$(0, 3)$$60$$(1, 0)$$-50$$(6, 0)$$-300$From the table,the smallest value obtained at a corner point is $-300$ at $(6, 0)$.Since the feasible region is unbounded,we must check if $-300$ is the true minimum.We graph the inequality $-50x + 20y If this open half-plane has common points with the feasible region,then $-300$ is not the minimum value.As seen in the graph,the line $-5x + 2y = -30$ passes through the feasible region,and the region $-5x + 2y Therefore,the objective function $Z = -50x + 20y$ has no minimum value subject to the given constraints.

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

Similar Questions

The following five inequalities form the feasible region: $2x - y \leq 8$,$x + y \leq 20$,$-x + y \geq -10$,$x \geq 0$,$y \geq 0$. Which of the following is a redundant constraint?

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:

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:

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:

For a linear programming problem,the objective function is $Z = 8000x + 12000y$. If the corner points of the feasible region are $(0,0)$,$(20,0)$,$(12,6)$,and $(0,10)$,then the maximum value of $Z$ occurs at which corner point?

Vedclass Test Series

Exam Paper Generator

Online Exam Module

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