Timeline for Find a non-convex instance for a non-convex set function with FindInstance
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 31, 2020 at 8:06 | comment | added | hxiao | @flinty Thank you very much for your explanations and solutions. | |
| Oct 31, 2020 at 8:05 | vote | accept | hxiao | ||
| Oct 30, 2020 at 14:57 | answer | added | flinty | timeline score: 1 | |
| Oct 30, 2020 at 14:43 | comment | added | flinty |
Does FindInstance work with set functions? No it doesn't. You could express your sets as fixed length binary vectors, then the union corresponds to a BitOr and the intersection corresponds to a BitAnd. You should provide the f you're using and an example set as this will help get an answer.
|
|
| Oct 30, 2020 at 14:05 | history | asked | hxiao | CC BY-SA 4.0 |