Q137
While solving a LP problem, infeasibility may be removed by?
A.
Adding another constraint
B.
Adding another variable
C.
Removing a constraint
AnswerD.
Removing a variable
Answer: Option C
Solution
Answer: Option C
Solution:
While solving a LP problem, infeasibility may be removed by removing a constraint. A linear program is infeasible if there exists no solution that satisfies all of the constraints in other words, if no feasible solution can be constructed.