Consider the Vandermonde product $\prod_{1\le j < k \le n} |z_j - z_k|$. It is well-known that under the constraint $|z_j| \le 1$ for all $j$, the product is maximized at a picket fence configuration of the form $z_j = e^{2 \pi i j / n}$, with a maximum value of $n^{n/2}$; see here.
Now instead of the simple constraint above, I impose $|z_j| \le r_j$, with the convention that $0 < r_1 \le r_2 \le \ldots \le r_n$. The maximizing configuration is obviously going to be more complicated, but I conjecture the following upper bound on the maximum value: $$ \prod_{1 \le j < k \le n}|z_j - z_k| \le n^{n/2}\prod_{j=1}^n r_j^{j-1}.$$
Is this true? Any partial result (including weaker bound) is welcome.
Update: the case $n=2$ is trivially verified since the left hand side is $\le r_1 + r_2 \le 2 r_2$. For $n=3$, consider projecting the optimizing $z_j$'s radially to the outermost circle of radius $r_3$, and call them $\zeta_j$'s, so that $\zeta_3 = z_3$. One must have $|\zeta_j - \zeta_k| > r_3$. This ensures that the radial projection can only increase the product. But for higher $n$, this last condition does not necessarily hold, so one has to account for the tradeoff between the losses and gains from outward radial projection.