• 论文 • 上一篇    下一篇

能力受限的运输问题的算法

王寅初   

  1. 江苏省计委计算站
  • 出版日期:1981-03-20 发布日期:1981-03-20

王寅初. 能力受限的运输问题的算法[J]. 数值计算与计算机应用, 1981, 2(3): 143-148.

AN ALGORITHM FOR TRANSPORT PROBLEM WHOSE ABILITY IS RESTRICTED

  1. Wang Yin-chu Computer Installation of Jiangsu Planning Committee
  • Online:1981-03-20 Published:1981-03-20
考虑能力受艰运输问题的数学模型,是在普通运输问题的基础上,添加能力受艰约束条件 在(1-2)式的约束下求(1-1)式的解仍是线性规划问题.当然可用单纯形法或微分算法求解,但需要很大的存贮量用来存放线性独立的约束方程的系数矩阵(其存贮量为
This paper is based on the connection of differential method with potential methodto solve the general transport problem. We present a method which does not need tostore enormous matrix of coefficients of the constraint condition. the implied informa-tion within the closed path of the potential method is used in or der that we canobtain the solution of the transport problem whose ability is restricted.
()

[1] 中国科学院数学研究所运筹学研究室,线性规划的理论及应用,高等教育出版社,1959.
[2] D. J. Wilde, C. S. Beightler, Fundation of Optimization, 1967(有中译本).
No related articles found!
阅读次数
全文


摘要