What is a redundant constraint in a linear programming model?
Correct answer: A. A constraint that does not restrict the feasible region
- A. A constraint that does not restrict the feasible region
- B. A constraint that makes the model infeasible
- C. A constraint that determines the objective value
- D. A constraint that requires integer decision variables
Explanation
A redundant constraint is already implied by the other constraints and therefore does not reduce the feasible region further. Removing it leaves the set of feasible solutions unchanged.
Report an error
The more specific you are, the faster it gets fixed. A source beats an opinion.
Prefer email? support@testustad.com
Practise Linear Programming
30 free Linear Programming MCQs from Quantitative Methods, each with the correct answer and an explanation. Unlimited attempts, no account needed.
Exams that ask Quantitative Methods questions like this
Quantitative Methods is on this paper prepared for on TestUstad, and all of them draw the same bank, so this question is worth knowing for it.
More Linear Programming questions
Maximize Z = 5x + 4y subject to 2x + y ≤ 8, x + 2y ≤ 8, and x, y ≥ 0. What is the optimal value of Z?
A company produces products A and B. Product A earns Rs. 30 and uses 2 labour hours, while product B earns Rs. 20 and uses 1 labour hour. If at most 100 labour hours are available, which objective function represents profit maximization?
In sensitivity analysis, what does the allowable increase of an objective coefficient indicate?
If a primal maximization problem and its dual minimization problem are both feasible, which relationship must hold for any feasible pair of solutions?