Exclusion of a redundant constraint does not affect the optimal solution to an LPP.
Reveal answer
Fill a bubble to check yourself
Keep practicing — related questions
- Optimum solution to an LPP always lies at least on the two vertices of the feasible region.
- For an LPP having " n " decision variables, there must be an equal number of constraints.
- An LPP is said to have feasible solution if it does not satisfy all the constraints of the problem.
- An LPP, with all its constraints are of the type ≤, is said to be in canonical form.
- Consider the linear programme (LP) Max 4x + 6y Subject to 3x + 2y $\leq$ 6 2x + 3y $\leq$ 6 x, y $\leq$ 0 A...
- Consider the following Linear Programming Problem (LPP): Maximize z = 3x1 + 2x2 Subject to x1 $\leq$ 4 x2 $...
- An LPP, with all its constraints are of the type ≥, is said to be in standard form.
- For solving an LPP by Simplex Method, it is necessary that all unrestricted variables are first replaced by...