Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
1 answer
243 views

Does quantifier elimination help here?

Suppose we have a quantified linear program $$\exists z_1,\dots,z_{poly(n)}\in\mathbb R$$ $$\exists u_1,\dots,u_n\in\mathcal P\cap\mathbb R^m$$ $$\forall v_1,\dots,v_n\in\mathcal P\cap\mathbb R^m$$ $$...
VS.'s user avatar
  • 1,826
0 votes
1 answer
110 views

Detecting non-negativity of a single constraint by polyhedral constraints - $I$

We consider $$\langle a,x\rangle=b$$ (linear constraints) where $x\in\mathbb R_{\geq0}^n$ and every entry in $a=(a_1,\dots,a_n)$ is in $\mathbb Z_{\geq0}^{n}$ (non-negative) and the entry $b$ is in $\...
Turbo's user avatar
  • 13.9k
-1 votes
2 answers
114 views

On OR condition in Linear Programming with exponentially many constraints [closed]

Suppose we have two linear programs $Ax\leq b$ and $Bx\leq c$ is there a way to combine them into one program of possibly a larger dimension $Cy\leq d$ such that projection of vectors $y$ into a ...
Turbo's user avatar
  • 13.9k