How can you determine whether a Linear Programming problem has no feasible solution using the final simplex tableau?
This question has been flagged
2
Replies
54
Views
If, in the final tableau, any artificial variable remains positive (greater than 0), then the problem has no feasible solution.
If the final simplex tableau has a positive artificial variable in the basis, the problem has no feasible solution.
Enjoying the discussion? Don't just read, join in!
Create an account today to enjoy exclusive features and engage with our awesome community!
Sign up