New answers tagged linear-programming
6
votes
Accepted
Prove that $ n \leq d+1 $ under ordering constraints in $\mathbb{R}^d$
For $d=2$ the maximal $n$ is $3=d+1$. Indeed, between 4 points $x_1,x_2,x_3,x_4$ either one of them, $x_k$, belongs to the convex hull of three others, then $\langle \theta,x_k\rangle$ can not be the ...
- 109k
4
votes
Prove that $ n \leq d+1 $ under ordering constraints in $\mathbb{R}^d$
This is not a complete answer, but too large to fit reasonably as a comment. As shown by Fedor Petrov, it is not true that $n \leq d+1$, since for $d = 3$ we can construct $5$ such points and ...
- 716
Top 50 recent answers are included