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?
Tell me more
×
Mathematics Stack Exchange is a question and answer site for
people studying math at any level and professionals in related fields. It's 100% free, no registration required.
|
|
|
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. |
|||
|
|
