On the fixed-charge transportation problem

Omega

Volumn 27, Issue 3, 1999, Pages 381-388

  Adlakha, Veena ^a   Kowalski, Krzysztof ^b  

^a UNIVERSITY OF BALTIMORE   (United States)

^b U S DEPARTMENT OF TRANSPORTATION   (United States)

Author keywords

Absolute point; Fixed charge; More for less paradox; Transportation problem

Indexed keywords

COMMERCE; MERGERS AND ACQUISITIONS; SHIPS;

ABSOLUTE POINTS; CONDITION; DISTRIBUTION PROBLEM; FIXED CHARGE TRANSPORTATION; FIXED CHARGES; FIXED COST; MORE-FOR-LESS PARADOX; TRANSPORTATION COST; TRANSPORTATION PROBLEM; VARIABLE COSTS;

COSTS;

EID: 0006172052     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0483(98)00064-4     Document Type: Article

References (20)

1. Adlakha V, Kowalski K. A quick sufficient solution to the more-for-less paradox in the transportation problems. OMEGA 1998, 26:541 - 547.
2. Arsham H. Postoptimality analyses of the transportation problem. J Oper Res Soc. 43:1992;121-139.
3. Balinski M.L. Fixed cost transportation problems. Naval Res Log Q. 8:1961;41-54.
4. Charnes A., Klingman D. The 'more-for-less' paradox in the distribution models. Cah Cent Etud Rech Oper. 13:1971;11-22.
5. Charnes A., Duffuaa S., Ryan M. The more-for-less paradox in linear programming. Eur J Oper Res. 31:1987;194-197.
6. Cooper L., Drebes C. An approximate algorithm for the fixed charge problem. Naval Res Log Q. 14:1967;101-113.
7. Diaby M. Successive linear approximation procedure for generalized fixed-charge transportation problems. J Oper Res Soc. 42:1991;991-1001.
8. Drenzler D.R. An approximate method for the fixed charge problem. Naval Res Log Q. 16:1969;411-416.
9. Gray P. Exact solution of the fixed-charge transportation problem. Oper Res. 19:1971;1529-1538.
10. Hirsch W., Danzig G.B. The fixed charge problem. Naval Res Log Q. 15:1968;413-424.
11. Kuhn H.W., Baumol W.J. An approximation algorithm for the fixed charge transportation problem. Naval Re. Log Q. 9:1962;1-15.
12. Murty K.G. Solving the fixed charge problem by ranking the extreme points. Oper Res. 16:1968;268-279.
13. Palekar U.S., Karwan M.H., Zionts S. A branch-and-bound method for the fixed charge transportation problem. Manage Sci. 36:1990;1092-1105.
14. Robb D.J. The more-for-less paradox in distribution models: an intuitive explanation. IIE Trans. 22:1990;377-378.
15. Ryan M. More-for-less paradox in the distribution model. Extremal methods and systems analysis. New York: Springer-Verlag, 1978. p. 275-303.
16. Sadagopan S., Ravindran A. A vertex ranking algorithm for the fixed-charge transportation problem. J Opt Theory Appl. 37:1982;221-230.
17. Sandrock K. A simple algorithm for solving small fixed-charge transportation problems. J Oper Res Soc. 39:1988;467-475.
18. Srinivasan V., Thompson G.L. An operator theory of parametric programming for the transportation problem. 1. Naval Res Log Q. 19:1972;205-225.
19. Steinberg D.I. The fixed charge problem. Naval Res Log Q. 17:1970;217-235.
20. Szwarc W. The transportation paradox. Naval Res. Log Q. 18:1971;185-202.