Can a linear programming problem have no feasible solution even if all variables are nonnegative? Why?
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
48
Views
Yes. Nonnegative variables alone do not guarantee feasibility. The other constraints can still conflict with each other, making it impossible for any nonnegative values of the variables to satisfy all constraints at the same time.
Yes, because the constraints can still conflict with each other even when all variables are nonnegative, making it impossible to satisfy all constraints at the same time.
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