Integer combination i want write a module to find the integer combination for a multi variable fomula. For example
$8x + 9y \le 124$
The module will return all possible positive integer for $x$ and $y$.Eg. $x=2$, $y=12$.
It does not necessary be exactly $124$, could be any number less or equal to $124$. Must be as close as possible to $124$ if no exact solution could be found.
I do not want to solve with brute force as the number of variable could be any...$(5,10,100,...n)$
Any algorithm could solve this?

Given a finite set $U$ of positive integers, and positive integers $B$ and $K$, the problem of determining whether there are non-negative integers $a(u)$ such that $K\le\sum_{u{\rm\ in\ }U}a(u)u\le B$ is NP-complete (which implies that it is computationally infeasible now and, perhaps, forever). This is discussed under the heading Integer Knapsack on page 247 of Garey and Johnson, Computers and Intractability. As has been pointed out already, it's easy if $\#U=2$. 
