An LPP has the constraints
Which one of the constraints can be removed without changing the feasible region?
Confirming your payment
Competency-Based Questions (CBQ) · Question 3 of 80
An LPP has the constraints
Which one of the constraints can be removed without changing the feasible region?
(A)
(B)
(C)
(D) None of them can be removed
Option (A) is correct.
Leave out and draw the rest. The corner points of the region given by , , , are
, , [from and ], [from and ], .
At these corners takes the values . A linear expression on a bounded convex region is greatest at a corner, so everywhere in the region. The constraint cuts nothing off, and removing it leaves the feasible region unchanged.
(B) is wrong: without , the point satisfies every other constraint but has , so the region would grow.
(C) is wrong: without , the point satisfies every other constraint (, , ) but has , so the region would grow.
(D) is wrong: can be removed, as shown above.