The corner points of the feasible region are | vedclass

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

Question

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

Vedclass · Accepted Answer

$0$

Vedclass · Answer

(D) To find the minimum value of the objective function $z = 300x + 190y$,we evaluate $z$ at each corner point of the feasible region:$1$. At point $A(0,0)$: $z = 300(0) + 190(0) = 0$$2$. At point $B(16,0)$: $z = 300(16) + 190(0) = 4800$$3$. At point $C(8,16)$: $z = 300(8) + 190(16) = 2400 + 3040 = 5440$$4$. At point $D(0,24)$: $z = 300(0) + 190(24) = 4560$Comparing these values $(0, 4800, 5440, 4560)$,the minimum value is $0$ at point $A(0,0)$.

The corner points of the feasible region are $A(0,0)$,$B(16,0)$,$C(8,16)$,and $D(0,24)$. The minimum value of the objective function $z = 300x + 190y$ is . . . . . . .

Similar Questions

The constraints $-x_{1} + x_{2} \leq 1$,$-x_{1} + 3x_{2} \leq 9$,and $x_{1}, x_{2} \geq 0$ define:

In the following figure,the feasible region (shaded) for a $LPP$ is shown. Determine the maximum and minimum value of $Z=x+2y$.

Solve the Linear Programming Problem graphically:
Maximise $Z = 3x + 4y$
subject to the constraints: $x + y \leq 4, x \geq 0, y \geq 0.$

Corner points of the feasible region for an $LPP$ are $(0,2), (3,0), (6,0), (6,8)$ and $(0,5)$. Let $Z = 4x + 6y$ be the objective function. The minimum value of $Z$ occurs at

Show that the minimum of $Z$ occurs at more than two points.
Maximize $Z = -x + 2y$,subject to the constraints:
$x \geq 3, x + y \geq 5, x + 2y \geq 6, y \geq 0$

Vedclass Test Series

Exam Paper Generator

Online Exam Module