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

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

0.00 Avg rating0 Votes
Article ID: iaor2002399
Country: United States
Volume: 27
Issue: 4
Start Page Number: 267
End Page Number: 278
Publication Date: Jul 1996
Journal: Networks
Authors:
Keywords: programming: linear
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.

Reviews

Required fields are marked *. Your email address will not be published.