Telegram Group 🔥🔥🔥
Get answers in minutes
Questions answered :
48
/50
Answer verified
In order for a linear programming problem to have a unique solution, the solution must exist at the intersection of two or more constraints. Then the problem becomes convex and has a single optimum(maximum or minimum) solution. Therefore the convex set of equations is included in the feasible region.
🗓 Jul 13, 2021
votes
Hailey
🌐 India
I'm in exam, can any one give the solution for this question
votes
Jennifer
🌐 India
Hello, please post an solution as well
Was your question answered?
Thanks for the feedback! ✅
Want to get famous? 📸
Answer question and get 🤩 high-lighted on our homepage.