What does it mean when a Linear Programming problem is infeasible?
This question has been flagged
2
Replies
56
Views
An infeasible Linear Programming problem occurs when there is no solution that satisfies all the constraints at the same time.
A Linear Programming problem is infeasible when there is no solution that satisfies all the constraints at the same time.
Example: If one constraint requires X \ge 10 while another requires X \le 5, no value of X can satisfy both, so the problem is infeasible.
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