| 引用本文: | 陈庆华.有容量限制的运输问题.[J].国防科技大学学报,1986,(3):87-92.[点击复制] |
| 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[点击复制] |
|
| |
|
|
| 本文已被：浏览 5017次 下载 5589次 |
| 有容量限制的运输问题 |
| 陈庆华 |
|
()
|
| 摘要: |
| 具有容量限制的运输问题可以用有界变量的线性规划问题求解[1]，但是问题的规模往往变得很大，给求解带来不便。本文给出求解这一问题的表上作业法。 |
| 关键词: |
| DOI： |
| 投稿日期：1985-10-24 |
| 基金项目: |
|
| A New Algorithm for Finding a Optimum Solution of the Transportation Problem with Capacity |
| 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: |
|
|
