Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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?

share|cite|improve this question
up vote 1 down vote accepted

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 $$

share|cite|improve this answer
Thanks, it should be called "integer linear programming" to be more exact. – darksky Mar 16 '13 at 3:37

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.