【摘要】 本文研究两类平面选址问题:(1)求一直线到n个给定点的加权距离和为最小;(2)求一点到n条给定直线的加权距离和为最小.对这两个非线性最优化问题,我们给出迭代次数为多项式的算法.更多还原

【Abstract】 This paper studies two point-line location probems in the plane as follows: (1) Determine a straight-line L to minimize the total weighted distances from n given points; (2) Determine a point X to minimize the total weighted distances from n given straight-lines. For these non-linear optimization problems, we present polynomial-time algorithms.更多还原