Approximating reduced costs under degeneracy in a network flow problem with side constraints

NCU Institutional Repository > 工學院 > 土木工程研究所 > 期刊論文 > Item 987654321/26325

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/26325

题名:	Approximating reduced costs under degeneracy in a network flow problem with side constraints
作者:	Yan,SY
贡献者:	土木工程研究所
关键词:	SENSITIVITY ANALYSIS;TOLERANCE APPROACH
日期:	1996
上传时间:	2010-06-29 17:10:50 (UTC+8)
出版者:	中央大學
摘要:	Reduced costs obtained from the optimal simplex tableau are not necessarily correct under degeneracy in network flow problems with side constraints. In one application, simplex reduced costs were shown not to be good when applied to actual operations, while reoptimization to find all true reduced costs was too time-consuming. An efficient algorithm to obtain approximate reduced costs was developed in the research to offset these disadvantages. The algorithm combines the uses of Lagrangian relaxation, a minimum-cost network flow algorithm, and a shortest path algorithm. In theory, the approximate reduced costs prove to be a better lower bound than are simplex reduced costs. Numerical experiments have been performed to show its potential usefulness in practice. (C) 1996 John Wiley & Sons, Inc.
關聯:	NETWORKS
显示于类别:	[土木工程研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	445	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing