| 有容量限制的运输问题 |
| |
| 引用本文： | 陈庆华.有容量限制的运输问题[J].国防科技大学学报,1986(3):87-92. |
| |
| 作者姓名： | 陈庆华 |
| |
| 摘 要： | 具有容量限制的运输问题可以用有界变量的线性规划问题求解,但是问题的规模往往变得很大,给求解带来不便。本文给出求解这一问题的表上作业法。
|
| 收稿时间： | 1985/10/24 0:00:00 |
A New Algorithm for Finding a Optimum Solution of the Transportation Problem with Capacity |
| |
| Chen Qinghua.A New Algorithm for Finding a Optimum Solution of the Transportation Problem with Capacity[J].Journal of National University of Defense Technology,1986(3):87-92. |
| |
| Authors: | Chen Qinghua |
| |
| Abstract: | The transportation problem with capacity can be solved by the simplex algorithm for solving linear programming problem with bounded variables; but,the scope of this problem is often very broad. This paper gives a new algorithm. |
| |
| Keywords: | |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《国防科技大学学报》浏览原始摘要信息 |
| 点击此处可从《国防科技大学学报》下载免费的PDF全文 |
