Timeline for How to tell Solve[] to satisfy as many constraints as it can?
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:55 | history | edited | CommunityBot | replaced http://mathematica.stackexchange.com/ with https://mathematica.stackexchange.com/ | |
| Mar 14, 2016 at 13:08 | history | edited | unlikely | CC BY-SA 3.0 | added 460 characters in body |
| Mar 14, 2016 at 0:34 | history | edited | unlikely | CC BY-SA 3.0 | added 119 characters in body |
| Mar 13, 2016 at 22:46 | history | edited | unlikely | CC BY-SA 3.0 | added another search option |
| Mar 13, 2016 at 10:22 | history | edited | unlikely | CC BY-SA 3.0 | added 15 characters in body |
| Mar 13, 2016 at 10:01 | history | edited | unlikely | CC BY-SA 3.0 | added 458 characters in body |
| Mar 13, 2016 at 9:39 | history | edited | unlikely | CC BY-SA 3.0 | added 81 characters in body |
| Mar 13, 2016 at 9:35 | comment | added | unlikely | @Mehrdad As you can see NMinimize handle some nonlinear constraint. And the example given can be expressed as linear. You can combine this approach with Solve and a search on binary trees or, more simply, with a full search to get what you want. | |
| Mar 13, 2016 at 9:31 | history | edited | unlikely | CC BY-SA 3.0 | added 828 characters in body |
| Mar 13, 2016 at 9:24 | comment | added | user541686 | Thanks but they're definitely nonlinear... even the example I gave isn't linear. | |
| Mar 13, 2016 at 8:57 | history | answered | unlikely | CC BY-SA 3.0 |