CMA Intermediate · Operations Management and Strategic Management · Optimum Allocation of Resources - LPP
In a graphical LPP, a redundant constraint is best described as one that
A redundant constraint is one that does not affect the feasible region because the remaining constraints already imply it. It does not cut off any feasible point, so removing it leaves the optimal solution unchanged. It is not the cause of infeasibility or alternative optima.
- Amakes the feasible region empty
- Bdoes not affect the feasible region because it lies outside or on its boundary without cutting itCorrect
- Calways passes through the optimal point and changes the optimum
- Dis parallel to the objective function and creates multiple optima
Explanation
A redundant constraint does not alter the feasible region, because the other constraints already enforce it. Removing it leaves the solution unchanged. An empty region indicates infeasibility, and parallelism with the objective relates to alternative optima, not redundancy.
Did you get it right without looking?
One question tells you little. A timed set on Optimum Allocation of Resources - LPP shows your real accuracy, how long you take and where you lose marks.
More Optimum Allocation of Resources - LPP questions
- In a final simplex table of a maximisation problem, the Cj - Zj value for a non-basic decision variable is -3. Which interpretation is corre…
- In a linear programming model, which of the following is an example of a non-negativity restriction?
- In a maximisation linear programming problem with three structural constraints (all of the ≤ type) and two decision variables, the dual prob…
- Which of the following is a basic assumption of linear programming?
- By the complementary slackness property of duality, if a primal constraint has positive slack (unused resource) at the optimal solution, the…
- In the graphical solution of a maximisation LPP, the feasible region is found to be unbounded in the direction of increasing objective value…