Timeline for An optimality condition for the corners of convex polytopes?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 18, 2016 at 4:03 | vote | accept | Manfred Weis | ||
| Jan 16, 2016 at 15:57 | history | edited | Manfred Weis | CC BY-SA 3.0 |
added a slight modification of the problem a follow up question
|
| Jan 15, 2016 at 19:05 | answer | added | Fedor Petrov | timeline score: 1 | |
| Dec 16, 2015 at 16:52 | answer | added | Manfred Weis | timeline score: 0 | |
| Oct 10, 2015 at 3:08 | comment | added | Manfred Weis | $k$ denotes the number of vertices defining a hyper facet of the convex polytope or the polytope itself. The question amounts to whether the above defined distance sum decreases if additional corners are brought into contact with the hyperplane, i.e. if the contact Dimension is increased. | |
| Oct 8, 2015 at 21:15 | comment | added | Joseph O'Rourke | You intend $k$ to be fixed? In what range? $0 \le k < n-d$? | |
| Oct 8, 2015 at 21:02 | history | edited | Stefan Kohl♦ | CC BY-SA 3.0 |
Language editing; added top-level tag.
|
| Jul 12, 2015 at 15:32 | history | asked | Manfred Weis | CC BY-SA 3.0 |