Timeline for Trying to obtain a numeric solution to an inequality. Code might be not working as intended
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 7, 2018 at 1:18 | vote | accept | AG1123 | ||
| Dec 6, 2018 at 9:16 | comment | added | AG1123 | I see. That was my suspicion too. Anyway, thanks a lot for the help! I definitely got something from your answer, so if there are no answers that completely solve my problem soon, I will accept yours. | |
| Dec 6, 2018 at 8:46 | history | edited | eyorble | CC BY-SA 4.0 |
added 272 characters in body
|
| Dec 6, 2018 at 8:44 | comment | added | eyorble |
FindMaximum is a local solver, so it's not sufficient proof that there are no solutions. NMaximize is a global solver, but it is numerical in nature, so it's not airtight proof that there is no solution. Maximize is a global symbolic solver, but probably won't be any faster than Solve or Reduce here. This approach isn't easily modifiable to prove the non-existence of a solution, sorry. This won't make Solve or Reduce any faster here either. With the unedited question it was easy to show that there was at least one solution, but your problem's a lot harder now.
|
|
| Dec 6, 2018 at 8:19 | comment | added | AG1123 | Assuming this is the case, how can I modify your code so that I can try to get an exact answer (e.g. using Reduce or Solve) to whether this inequality can ever be fulfilled? | |
| Dec 6, 2018 at 7:43 | comment | added | AG1123 | First of all, thanks for the answer! Then, apologies but I found some mistakes on the posted code: I had extra squares on the RankedMax's. After fixing this and running your code again, I get the following answer: {-1.28856*10^-15, {t1 -> 0.0000500457, l1 -> -0.000292867, t2 -> 0.0000500457, l2 -> -0.000292867, t3 -> 0.0000500492, l3 -> -0.000292906}} Does this, in your opinion, demonstrate that maybe no solutions exist? | |
| Dec 6, 2018 at 6:58 | history | answered | eyorble | CC BY-SA 4.0 |