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

NCUIR > Engineering College > Graduate Institute of Civil Engineering > journal & Dissertation > Item 987654321/26325

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/26325

Title:	Approximating reduced costs under degeneracy in a network flow problem with side constraints
Authors:	Yan,SY
Contributors:	土木工程研究所
Keywords:	SENSITIVITY ANALYSIS;TOLERANCE APPROACH
Date:	1996
Issue Date:	2010-06-29 17:10:50 (UTC+8)
Publisher:	中央大學
Abstract:	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.
Relation:	NETWORKS
Appears in Collections:	[Graduate Institute of Civil Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	467	View/Open

社群 sharing