# Integer optimization problem

Suppose we are given $Av - x \ge 0$, for a given $n \times n$ matrix A and an $n\times 1$ vector $x$. Find an integer valued vector $v$ of size $n \times 1$ such that $\mathbf{1} \cdot v$ is minimized (in other words the sum of its elements is minimized)

Also, A is symmetric and invertible, if that helps.

Any idea how to attack this problem?

-

Its an Linear programming problem, $$\min 1^T v$$ $$\text{s.t } Av > x$$ There exist many method for solving Integer LP. Write the above Optimization function in standard form and you can use Simplex method.
Standard Form: $$-\max (-1^Tv)$$ $$\text {s.t }-Av < x$$