Timeline for Searching extreme points of polyhedron
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 25, 2019 at 15:14 | comment | added | Andrey Lovyagin | My mistake. They are able to find an extreme points, but only one (cuz optimization). In an example, in scipy docs there are 2 more extreme points, but they output only one. | |
| Apr 25, 2019 at 14:46 | comment | added | Andrey Lovyagin | Okay, I have checked it fully. Scipy functions didn't do the same. Scipy very useful for optimizing, but my task not only linear programming but also math programming, that's why A_ub and b_ub didn't help (I checked link examples, their answers are not extreme points for any inequality or equality. | |
| Apr 22, 2019 at 20:40 | comment | added | Reinderien | Read about the A_ub, b_ub arguments. | |
| Apr 22, 2019 at 20:39 | comment | added | Andrey Lovyagin | Thank you very much for all that you have done! Also, I checked scipy.optimize.linprog() function and I can't really understand how it can replace much of the code. I will learn and read more about it, but on first sight, it looks like it can't solve non-equational system (I mean not '=', but any sign, e.g. '>='), that is why I can't see how I can find extreme points by it. | |
| Apr 22, 2019 at 16:18 | comment | added | Reinderien | @AndreyLovyagin docs.scipy.org/doc/scipy/reference/generated/… | |
| Apr 22, 2019 at 16:03 | history | edited | Reinderien | CC BY-SA 4.0 |
More minor improvements, inspections in PyCharm reduced to 2
|
| Apr 22, 2019 at 8:17 | comment | added | Andrey Lovyagin | Sorry, but I can't find the same function in scipy. Can you provide me the name of function? | |
| Apr 22, 2019 at 7:57 | comment | added | Andrey Lovyagin | Thank you! In meantime I made it work with any NumPy version now (about loop error you report). | |
| Apr 22, 2019 at 0:46 | history | answered | Reinderien | CC BY-SA 4.0 |