Given $n$ fixed points $\{p_i\}_{i=1}^n$ in $D$-dimensional Euclidean space $\mathbb{R}^D$, consider the following optimization problem:$$\begin{align}  \text{mininize} \ \ \ &\prod_{i=1}^n \lVert p-p_i\rVert\\  \text{subject to: } & \lVert p-p_i\rVert \ge 1, \text{for } i=1,\cdots,n\end{align}$$The constraint is to make sure that trivial solution $p=p_i$ won't occur.  Q. Has there been any literature discussing such problem already?Thanks in advance.
Minimize the product of distances from n fixed points
reference request;optimization;cg.comp geom