Determining All Nondegenerate Shadow Prices for the Transportation Problem

C. O. Fong and V. Srinivasan
Additional contact information
C. O. Fong: University of Malaya, Kuala Lumpur, Malaysia
V. Srinivasan: Stanford University, Stanford, California

Transportation Science, 1977, vol. 11, issue 3, 199-222

Abstract: Shadow prices derived from the optimal dual solution of a transportation problem give the rate at which the optimal cost changes when a warehouse capacity or market requirement is changed ceteris paribus. One of the limitations in interpreting shadow prices for managerial use is that they may be degenerate, i.e., their interpretation may be valid only over a zero range of the parameter to be varied. This paper provides an efficient procedure for computing all nondegenerate (or “real”) shadow prices. The method involves breaking the optimal basis tree into subtrees by dropping basic variables which are at their bounds, defining a measure of distance between the subtrees and solving a shortest path problem between all pairs of subtrees.

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

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.11.3.199 (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:ortrsc:v:11:y:1977:i:3:p:199-222

Access Statistics for this article

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