What's "simplest" is highly context dependent - context which you have not supplied. However, one important aspect of simplicity is computational effectivity. In order to have any hope of effectively computing with such radicals it is essential to normalize them so that any algebraic relationships are made explicit. For example, suppose that you are computing with expressions involving $\:5\:$ raised to the powers $\ 1/6,\ 1/10,\:$ and $\:1/15\:.\:$ Then such expressions can all be expressed as polynomials in the single radical $\:5^{1/30}\:,\:$ e.g. $\rm\:5^{1/6} = (5^{1/30})^5\:.\:$ Said in the language of field theory $\rm\ \mathbb Q(5^{1/6},\:5^{1/10},\:5^{1/15}) \subset \mathbb Q(5^{1/30})\:.\:$ Therefore arithmetic operations on such radical expressions reduce to simple efficient polynomial operations, viz. operations in the ring $\rm\ Q[x]\ (mod\ x^{30}-5)\:.\:$
Such normalization is even more crucial when working with multiple radicands. For example $\ \sqrt{6}\ \sqrt{10}\ \sqrt{15}\ =\ 30\:,\:$ so this algebraic dependence needs to be eliminated by choosing two of the three radicands as a basis, say $\:\sqrt{6},\ \sqrt{10}\:,\ $ then eliminating $\:\sqrt{15}\ $ using $\rm\ \sqrt{15}\ =\ \sqrt{6}\ \sqrt{10}/2\:.\:$ Developing effective algorithms for computing with such radicands (e.g. denesting) is a highly nontrivial task, based on the Galois theory of radical extensions (Kummer theory). This is the theory at the basis of such effective algorithms implemented in computer algebra systems.