Consider a LPP given by minimize Z = 6x + 10y | vedclass

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

Question

(B) The constraints are $x \geq 6, y \geq 2, 2x + y \geq 10, x \geq 0, y \geq 0$. $1$. Since $x \geq 6$,it automatically implies $x \geq 0$. Thus,$x \

Vedclass · Accepted Answer

$2x + y \geq 10, x \geq 0, y \geq 0$

Vedclass · Answer

(B) The constraints are $x \geq 6, y \geq 2, 2x + y \geq 10, x \geq 0, y \geq 0$. $1$. Since $x \geq 6$,it automatically implies $x \geq 0$. Thus,$x \geq 0$ is a redundant constraint. $2$. Since $y \geq 2$,it automatically implies $y \geq 0$. Thus,$y \geq 0$ is a redundant constraint. $3$. For the constraint $2x + y \geq 10$,we substitute the minimum values $x = 6$ and $y = 2$: $2(6) + 2 = 12 + 2 = 14$. Since $14 \geq 10$,the constraint $2x + y \geq 10$ is satisfied by the region defined by $x \geq 6$ and $y \geq 2$. Thus,$2x + y \geq 10$ is also a redundant constraint. Therefore,the redundant constraints are $2x + y \geq 10, x \geq 0, y \geq 0$.

Consider a $LPP$ given by minimize $Z = 6x + 10y$. Subject to $x \geq 6, y \geq 2, 2x + y \geq 10, x \geq 0, y \geq 0$. Redundant constraints in this $LPP$ are $....$

Similar Questions

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:

Solve the following problem graphically:
Minimise and Maximise $Z=3x+9y$......$(1)$
subject to the constraints:
$x+3y \leq 60$.....$(2)$
$x+y \geq 10$......$(3)$
$x \leq y$.......$(4)$
$x \geq 0, y \geq 0$......$(5)$

The maximum value of $Z=x+3y$ subject to the constraints $2x+y \leq 20$,$x+2y \leq 20$,$x \geq 0$,$y \geq 0$ is:

In a Linear Programming Problem ($L$.$P$.$P$.), the corner points of the feasible region determined by the constraints $3x - y \geq 6$, $x \leq 3$, $y \leq 2$, $y \geq 0$, and $x \geq 0$ are:

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

Vedclass Test Series

Exam Paper Generator

Online Exam Module