【摘要】 本文提出了一类求闭凸集上Ｆｅｒｍ ａｔ场址最优解的信赖域算法，该算法既不要求诸旧场址不共线，也不要求迭代近似矩阵列｛Ｂｋ｝有界，同时具有全局收敛性．更多还原

【Abstract】 A trust region algorithm for Fermat location on a closed convex domain in R n is provided, neither the assumption that the points a 1,…,a m are not collinear nor the condition that the second approximate matrices {B k} are bounded is necessary. The global convergence of the algorithm is proved.更多还原