Question
Question: In a graphical solution, the redundant constraint is ( a ) which form the boundary of the feasible...
In a graphical solution, the redundant constraint is
( a ) which form the boundary of the feasible region
( b ) which do not optimize the objective function
( c ) which does not form the boundary of the feasible region.
( d ) which optimize the objective function
Solution
To solve this question, we will first see the meaning of redundant constraint and then with an example, we will show that if there are two constraints differ by an integer then one of the constraints can be ignored and that ignored constraint is the redundant constraint.
Complete step-by-step solution:
Before we start the solution, let us see what is LPP, what is the objective function, what is the feasible region, and what is a redundant constraint.
Linear Programming Problem ( LPP ) is a mathematical method that is used to determine the best possible outcome or solution from a given set of parameters or lists of requirements, which is represented in the form of linear relationships.
The objective function of LPP is that function which is desired to be maximized or minimized.
A feasible solution is a set of values for the decision variables that satisfies all the constraint in a linear programming problem.
Now, redundant constraints are constraints that can be omitted from a system of linear constraints without hanging the feasible region.
Let, get all definitions with an example.
Let , we have LPP problem to solve x+2y≥20 and 2x+4y≥40. So, these two are constraints.
Now, let see second constraint 2x+4y≥40,
We can write 2x+4y≥40 as 2(x+2y)≥40,
On solving we get, x+2y≥20 which is the same as the first constraint.
Therefore, 2x+4y≥40 can be removed. By removing this constraint the feasible region does not change that is both constraints will show the same feasible region.
Feasible region of x+2y≥20 is,
So, the redundant constraints cannot be the boundary of the feasible region.
Hence, option ( c ) is correct.
Note: This question was not numerically based but was theoretical so, for these types of questions concept of linear programming problem ( LPP ) must be remembered and must have a better understanding of definitions of the term related to LPP.