Timeline for Is it possible to backtrack an optimization solver? [closed]
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 9 at 15:12 | history | closed |
gmvh Max Alekseyev Dave Benson Daniele Tampieri Alexey Ustinov |
Needs details or clarity | |
| Dec 9 at 13:18 | comment | added | Michal Adamaszek | If it is a continuous LP then the optimizer should give you an infeasibility certificate, ie. a (small, if you're lucky) set of conflicting constraints. Finding a certificate is not any different than optimizing and is typically just one of the conclusions the optimizer can reach. Check for instance "Farkas lemma". From your description ("past a certain size") it could also be numerical issues or the like that come into play, especially if you actually expect it to always be feasible. | |
| Dec 9 at 10:30 | review | Close votes | |||
| Dec 9 at 15:12 | |||||
| S Dec 9 at 10:02 | review | First questions | |||
| Dec 9 at 10:10 | |||||
| S Dec 9 at 10:02 | history | asked | Bamboozle | CC BY-SA 4.0 |