
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
Answer
498.6k+ views
1 likes
Hint: 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 and . So, these two are constraints.
Now, let see second constraint ,
We can write as ,
On solving we get, which is the same as the first constraint.
Therefore, 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 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.
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
Now, let see second constraint
We can write
On solving we get,
Therefore,
Feasible region of

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.
Recently Updated Pages
Express the following as a fraction and simplify a class 7 maths CBSE

The length and width of a rectangle are in ratio of class 7 maths CBSE

The ratio of the income to the expenditure of a family class 7 maths CBSE

How do you write 025 million in scientific notatio class 7 maths CBSE

How do you convert 295 meters per second to kilometers class 7 maths CBSE

Write the following in Roman numerals 25819 class 7 maths CBSE

Trending doubts
State and prove Bernoullis theorem class 11 physics CBSE

What are Quantum numbers Explain the quantum number class 11 chemistry CBSE

Write the differences between monocot plants and dicot class 11 biology CBSE

1 ton equals to A 100 kg B 1000 kg C 10 kg D 10000 class 11 physics CBSE

State the laws of reflection of light

In northern hemisphere 21st March is called as A Vernal class 11 social science CBSE
