A Transportation Problem in Which Costs Depend on the Order of Arrival

Eric V. Denardo, Uriel G. Rothblum and Arthur J. Swersey
Additional contact information
Eric V. Denardo: Yale School of Organization and Management, Box 1A, New Haven, Connecticut 06520
Uriel G. Rothblum: The Technion, Haifa, Israel
Arthur J. Swersey: Yale School of Organization and Management, Box 1A, New Haven, Connecticut 06520

Management Science, 1988, vol. 34, issue 6, 774-783

Abstract: This paper describes a problem in which the "cost" of satisfying the demand at a particular location is a weighted average of the travel times for the items that are supplied. The greatest weight is given to the first-arriving item, with decreasing weights given to each succeeding item. In the case of known demand, the problem is transformed into an equivalent transportation problem. In the case of stochastic demand, the problem is transformed into a transportation problem whose objective is to minimize the sum of a linear function and a convex function of the sum of the flows on selected arcs. This problem is linearized by substituting for the convex function the product of a parameter and a linear term. The parameterized problem is solved by parametric linear programming and by "updating the slope."

Keywords: networks/graphs: flow algorithms; networks/graphs: stochastic; programming: nonlinear (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.34.6.774 (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:ormnsc:v:34:y:1988:i:6:p:774-783

Access Statistics for this article

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