摘要
本文研究两类平面选址问题:(1)求一直线到n个给定点的加权距离和为最小;(2)求一点到n条给定直线的加权距离和为最小.对这两个非线性最优化问题,我们给出迭代次数为多项式的算法.
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.
出处
《运筹学学报》
CSCD
北大核心
2002年第3期61-68,共8页
Operations Research Transactions
基金
国家自然科学基金资助课题(10071076)
关键词
平面选址问题
点-线距离
凸规划
多项式算法
Location problem in the plane, point-line distance, convex program- ming, polynomial algorithms.
