Machine-translated by Google. Questions are authored in English.
Top

Linear Programming Formulation Questions and Answers

Answer: B

A redundant constraint is one which does not form the boundary of the feasible region.

In the graphical method, the feasible region is the intersection of all the constraint half-planes. A constraint is redundant when the other constraints already imply it: its line lies wholly outside the feasible region, so removing it leaves the region unchanged and it contributes no edge.

Constraints whose lines do form the boundary are binding somewhere and are not redundant. Optimising the objective is a property of points (vertices), not of constraints, so the last two options do not describe redundancy.

Please log in or register to report this question.

Loading…

Other Subjects

Tags: Linear Programming Formulation Questions and Answers || Linear Programming Formulation MCQ Questions and Answers || Linear Programming Formulation GK Questions and Answers || Linear Programming Formulation GK MCQ Questions || Linear Programming Formulation Multiple Choice Questions and Answers || Linear Programming Formulation GK || GK on Linear Programming Formulation || Operations Research Questions and Answers || Operations Research MCQ Questions and Answers || Operations Research GK Questions and Answers || GK on Operations Research