引用本文: | 张干宗,粟塔山.两种选址问题的算法及有关结论[J].国防科技大学学报,1990,12(3):1-7.[点击复制] |
Zhang Ganzong,Su Tashan.The Algorithm for Two Location Problems and Some Related Conc1usions[J].Journal of National University of Defense Technology,1990,12(3):1-7[点击复制] |
|
|
|
本文已被:浏览 5027次 下载 5329次 |
两种选址问题的算法及有关结论 |
张干宗, 粟塔山 |
(系统工程与应用数学系)
|
摘要: |
本文提出两种选址问题,对其局部最优性建立了充要条件,并在此基础上提出了该类问题的有效算法。 |
关键词: 运筹分析,规划,算法,选址问题,局部最优性,充要条件 |
DOI: |
投稿日期:1989-04-10 |
基金项目: |
|
The Algorithm for Two Location Problems and Some Related Conc1usions |
Zhang Ganzong, Su Tashan |
(Department of Applied Mathematics and System Engineering)
|
Abstract: |
In this paper,two location problems have been put forward. A necessary and sufficient condition of local optimality is established. On the basis of this analysis,an efficient algorithm to solve these location problems is proprosed. |
Keywords: operations analysis,programming,algorithm,location problem,local optimality,necessary and sufficient condition |
|
|
|
|
|