|
|||||
|
|
| 两种选址问题的算法及有关结论 | |
| 引用本文： | 张干宗,粟塔山.两种选址问题的算法及有关结论[J].国防科技大学学报,1990,12(3):1-7. |
| 作者姓名： | 张干宗 粟塔山 |
| 作者单位： | 国防科技大学系统工程与应用数学系 (张干宗)，国防科技大学系统工程与应用数学系(粟塔山) |
| 摘 要： | 本文提出两种选址问题,对其局部最优性建立了充要条件,并在此基础上提出了该类问题的有效算法。 |
| 关 键 词： | 运筹分析 规划 算法 选址问题 局部最优性 充要条件 |
| 收稿时间： | 1989/4/10 0:00:00 |
The Algorithm for Two Location Problems and Some Related Conc1usions |
|
| Zhang Ganzong and 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. | |
| Authors: | Zhang Ganzong and Su Tashan |
| Institution: | Department of Applied Mathematics and System Engineering |
| Abstract: | In this paper,two location problems have been put forward.A necessaryand sufficient condition of local optimality is established.On the basis ofthis analysis,an efficient algorithm to solve these location problems isproprosed. |
| Keywords: | operations analysis programming algorithm location problem local optimality necessary and sufficient condition |
| 本文献已被 CNKI 等数据库收录！ | |
| 点击此处可从《国防科技大学学报》浏览原始摘要信息 | |
| 点击此处可从《国防科技大学学报》下载免费的PDF全文 | |