PRC-2 · Chapter 4 · Question 5 of 60
What is the term for a constraint in a linear programming model that does not impact the formation of the feasible region because another constraint is already more restrictive?
Test yourself: pick an answer
Reveal answer & explanation
Correct answer: C) Redundant constraint
Explanation
A redundant constraint is an inequality that, if removed from the system, would not change the shape or boundaries of the feasible region because other constraints already limit the area more strictly.
More Linear Programming MCQs
- Q7Which of the following mathematical equations represents a straight line that passes through the origin?
- Q8In a product mix decision, what does the inequality constraint x + y ≤ 150 signify?
- Q9For a strict production constraint given as x + y ≤ 80, what is the maximum possible value of x assuming production of y is halted entirely?
- Q10What is the primary business logic behind enforcing the non-negativity constraints x ≥ 0 and y ≥ 0 in linear programming models?
- Q11Given an objective function designed to minimize cost where C = 3x + 4y, and the corner points of the feasible region are (2, 5), (4, 1)…