| 引用本文: | 李登峯.一种新的运输问题对偶算法.[J].国防科技大学学报,1990,12(3):70-75.[点击复制] |
| Li Dengfeng.A New Dual Algorithm for the Transportation Problem[J].Journal of National University of Defense Technology,1990,12(3):70-75[点击复制] |
|
| |
|
|
| 本文已被：浏览 5650次 下载 5750次 |
| 一种新的运输问题对偶算法 |
| 李登峯 |
|
(系统工程与应用数学系)
|
| 摘要: |
| 本文给出求解运输问题的一种新的方法—运输问题对偶算法(仍是表上作业法)。最后给出的实例说明本文算法在解决某些问题时比[1]中方法简便。 |
| 关键词: 线性规划，运输模型，对偶理论，正则解，可行解，可增路 |
| DOI： |
| 投稿日期：1988-09-15 |
| 基金项目: |
|
| A New Dual Algorithm for the Transportation Problem |
| Li Dengfeng |
|
(Department of Applied Mathematics and System Engineering)
|
| Abstract: |
| The paper gives a new method for solving the transportation problem-the dual algorithm for the transportation problem (on the table work). Finally，the author gives one examples which show that the algorithm is simpler for solving some problems than the method in [1]. |
| Keywords: linear programming,transportation model,duality theory,regular solution,feasible solution,incremental path |
|
|
