Abstract
In a recent paper, Ahrens and Finke present a procedure for resolving degeneracy in the fixed cost transportation problem by perturbing the supplies and demands. This paper presents computational results of using that procedure in both vertex ranking and branch-and-bound algorithms for the fixed charge transportation problems as compared to using previously available methods for resolving degeneracy in those algorithms.
This is a preview of subscription content, log in via an institution to check access.
References
J.H. Ahrens and G. Finke, “Degeneracy in fixed charge transportation problems”,Mathematical Programming 8 (1975) 369–374.
M.L. Balinski, “Fixed cost transportation problems”,Naval Research Logistics Quarterly 8 (1961) 41–54.
J. Fisk and P.G. McKeown, “Determining the maximum degenerate solution for transportation problems”, SUNY/Albany Working Paper (1976).
P. Gray, “Exact solution of the fixed charge transportation problem”,Operations Research 19 (1971) 1529–1538.
J.L. Kennington, “The fixed charge transportation problem: a computational study with a branch-and-bound code”,AIIE Transactions 8 (1976) 241–247.
P.G. McKeown and D.S. Rubin, “Adjacent vertices on transportation polytopes”,Naval Research Logistics Quarterly 22 (1975) 365–374.
P.G. McKeown, “Vertex ranking algorithms: a computational survey”, in:Transactions of the bicentennial mathematical programming conference, to appear.
K.G. Murty, “Solving the fixed charge problem by ranking the extreme points”,Operations Research 16 (1968) 268–279.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
McKeown, P.G. Some computational results of using the Ahrens—Finke method for handling degeneracy in fixed charge transportation problems. Mathematical Programming 15, 355–359 (1978). https://doi.org/10.1007/BF01609041
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01609041