While solving a LP problem, infeasibility may be removed by
A) Adding another constraint
B) Adding another variable
C) Removing a constraint
D) Removing a variable

Name: While solving a LP problem, infeasibility may be removed by A) Adding another constraint B) Adding another variable C) Removing a constraint D) Removing a variable
Brand: Quizplus
Rating: 4.8 (35 reviews)

Question

Quizplus · Accepted Answer

Removing a constraint can potentially remove the infeasibility in a Linear Programming (LP) problem by relaxing the system, thus allowing for a feasible solution space.

While Solving a LP Problem, Infeasibility May Be Removed by