On the fixed-charge transportation problem
Veena Adlakha and
Krzysztof Kowalski
Omega, 1999, vol. 27, issue 3, 381-388
Abstract:
In many distribution problems, the transportation cost consists of a fixed cost, independent of the amount transported and a variable cost, proportional to the amount shipped. In such fixed-charge transportation problems, is it possible to find a solution with less (or equal) cost than the optimal solution by shipping more units, under the condition that at least the same amount is shipped from each supply point and to each market? This question has not received any attention in the literature, and no algorithm (either analytical or heuristic) is known to address this problem. The more-for-less analysis could be useful for managers in decisions such as increasing warehouse/plant capacity, analyzing company acquisitions, mergers, consolidations or downsizing. In this paper we develop a quick sufficient condition to identify candidate markets and supply points to ship more for less in fixed-charge transportation problems.
Keywords: More-for-less; paradox; Fixed-charge; Transportation; problem; Absolute; point (search for similar items in EconPapers)
Date: 1999
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0305-0483(98)00064-4
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:27:y:1999:i:3:p:381-388
Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01
Access Statistics for this article
Omega is currently edited by B. Lev
More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().