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

I am trying to solve a problem which I have reduced down to find out one of integer solutions to a number of nonhomogeneous linear inequalities.

Can this be done efficiently ? If so: how?; if not: why?

share|cite|improve this question

You are describing integer programming. It's an NP-hard problem, so there are no known efficient (i.e., polynomial-time) solutions in general. However, this does not mean that your particular problem cannot be solved in reasonable time. Try the GLPK.

share|cite|improve this answer

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.