Technical Note—Exact Solution of the Fixed-Charge Transportation Problem

Paul Gray
Additional contact information
Paul Gray: Georgia Institute of Technology, Atlanta, Georgia

Operations Research, 1971, vol. 19, issue 6, 1529-1538

Abstract: In the fixed-charge transportation problem, a fixed charge is associated with each route that can be opened, in addition to the variable transportation cost proportional to the amount of goods shipped- This note presents an exact solution of this mixed integer programming problem by decomposing it into a master integer program and a series of transportation subprograms. To reduce the number of vertices that need to be examined, bounds are established on the maximum and minimum values of the total fixed cost, and feasibility conditions for the transportation problem are used extensively. Computational results show the method to be particularly suitable when fixed costs are large compared to variable costs. A composite algorithm based on Murty's and the author's results is proposed.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.6.1529 (application/pdf)

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:inm:oropre:v:19:y:1971:i:6:p:1529-1538

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().