Given a matrix in row-reduced form, like
except usually bigger, and with fractional values: given that the variables x1...xn are integers greater than zero, is there a quick way to tell how many solutions there are? Quick is a relative term here; I don't mean quick when done manually, anything that runs in polynomial time would be awesome.
Thanks in advance!
Code:
1 0 0 4 | 9 0 1 0 2 | 4 0 0 1 9 | 12
except usually bigger, and with fractional values: given that the variables x1...xn are integers greater than zero, is there a quick way to tell how many solutions there are? Quick is a relative term here; I don't mean quick when done manually, anything that runs in polynomial time would be awesome.
Thanks in advance!