A Linear Programming problem is infeasible when no solution satisfies all constraints.
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
2
Replies
53
Views
True
True. An LP problem is infeasible when there is no solution that satisfies all of its constraints simultaneously.
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