Technical Note—Cost/Completion-Date Tradeoffs in the Transportation Problem

Theodore S. Glickman and Paul D. Berger
Additional contact information
Theodore S. Glickman: Boston University, Boston, Massachusetts
Paul D. Berger: Boston University, Boston, Massachusetts

Operations Research, 1977, vol. 25, issue 1, 163-168

Abstract: The transportation problem is reconsidered to include the objective of minimizing the date at which all shipments are completed, in addition to the usual objective of minimizing total shipping cost. After proposing an algorithm requiring reoptimization of the previously determined solution to obtain the next one, we offer an illustration and address the question of tradeoffs between the two objectives.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.25.1.163 (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:25:y:1977:i:1:p:163-168

Access Statistics for this article

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