What does it mean for a Linear Programming problem to be infeasible, and how do constraint lines look on a graph when this occurs?
Welcome!
This community is for professionals and enthusiasts of our products and services.
Share and discuss the best content and new marketing ideas, build your professional profile and become a better marketer together.
This question has been flagged
3
Replies
37
Views
An infeasible Linear Programming problem means there is no common region that satisfies all the constraints. On a graph, the shaded regions from the constraint lines do not overlap, so there is no feasible solution.
The problem is infeasible when the constraint lines have no common feasible area, meaning no point satisfies all constraints simultaneously.
An infeasible LP problem means there is no solution that satisfies all the constraints. On a graph, the constraint lines create regions that do not overlap, so there is no feasible region.
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