We describe algorithms for testing polycyclicity and nilpotency for finitely generated subgroups of GL( d, Q) and thus we show that these properties are decidable. Variations of our algorithm can be used for testing virtual polycyclicity and virtual nilpotency for finitely generated subgroups of GL(d, Q).</p
