Skip to main content

All Questions

Filter by
Sorted by
Tagged with
7 votes
2 answers
242 views

Prove that $ n \leq d+1 $ under ordering constraints in $\mathbb{R}^d$

Let $x_1, \dotsc, x_n \in \mathbb{R}^d$ and $\theta_1, \dotsc, \theta_n \in \mathbb{R}^d$ be vectors such that for every $k \in [n]$, the following inequality holds: $$ \langle x_k, \theta_k \rangle &...
Alireza Bakhtiari's user avatar
1 vote
1 answer
126 views

a linear programming problem

Recently I have a conjecture on decomposing a linear program into smaller ones. I have tested it in Mathmatica by a lot of examples. However, I cannot prove it. I will appreciate if someone can give ...
Cooler Panda's user avatar
1 vote
1 answer
296 views

Deducing Linear Inequalities

Let $X_1,X_2,\ldots,X_n $ be indeterminates. Denote by $S$ the set of all linear inequalities of the form $X_{i_1}+X_{i_2}+\ldots+X_{i_k} \geq k,$ with $k \in \{ 1,2,\ldots,n \}$ and $1 \leq i_1< ...
user21277's user avatar
  • 185
0 votes
1 answer
81 views

Can convex combinations of indicator functions for pairwise non-disjoint sets unordered by inclusion dominate one another?

Let $N$ be a finite subset of the naturals. Let $P$ be a set of subsets of $N$ such that: 1) $P\neq \varnothing$, 2) $\forall x\in P, |x| >1$, 3) $\forall x,y\in P,$ if $x\neq y$, then $x\not\...
VMfoobar's user avatar