| 生产网络流最小费用问题 |
| |
| 引用本文： | 胥晓庆,唐恒永.生产网络流最小费用问题[J].沈阳师范大学学报(自然科学版),2007,25(2):140-143. |
| |
| 作者姓名： | 胥晓庆 唐恒永 |
| |
| 作者单位： | 沈阳师范大学,数学与系统科学学院,辽宁,沈阳,110034 |
| |
| 摘 要： | 生产网络流是一种广义的网络流模型,是基于复杂的生产过程,重新建立的一种新模型.本文主要讨论了生产网络流的最小费用问题,在研究该问题的基本结构及其对偶性质的基础上给出了该问题的网络单纯形法.
|
| 关 键 词： | 生产网络流 最小费用流 网络单纯形法 |
| 文章编号： | 1673-5862(2007)02-0140-04 |
| 修稿时间： | 2007-01-09 |
Minimum Cost Problem of Manufacturing Network Flows |
| |
| XU Xiao-qing,TANG Heng-yong.Minimum Cost Problem of Manufacturing Network Flows[J].Journal of Shenyang Normal University: Nat Sci Ed,2007,25(2):140-143. |
| |
| Authors: | XU Xiao-qing TANG Heng-yong |
| |
| Affiliation: | College of Mathematics and Systems Science, Shanyang Normal University, Shanyang 110034, China |
| |
| Abstract: | Manufacturing network flows is a generalized network model,a rebuilt new model complicated manufacturing scenarios.The infrastructure and dual properties of the so-called minimum cost problem are specifically studied to outline a network simplex method for solving this problem. |
| |
| Keywords: | manufacturing network flows minimum cost problem network simplex method |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
