If the addition of a constraint to a linear programming problem does not change the solution, the constraint is said to be
A)unbounded.
B)non-negative.
C)infeasible.
D)redundant.

Name: If the addition of a constraint to a linear programming problem does not change the solution, the constraint is said to be A)unbounded. B)non-negative. C)infeasible. D)redundant.
Brand: Quizplus
Rating: 4.8 (25 reviews)

Question

Quizplus · Accepted Answer

A redundant constraint does not affect the feasible region and therefore does not affect the optimal solution.

If the Addition of a Constraint to a Linear Programming