DETERMINING ALL NONDEGENERATE SHADOW PRICES FOR THE TRANSPORTATION PROBLEM

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.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    428 East Preston Street
    Baltimore, MD  United States  21202
  • Authors:
    • Fong, C O
    • Srinivasan, V
  • Publication Date: 1977-8

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00176831
  • Record Type: Publication
  • Source Agency: Engineering Index
  • Files: TRIS
  • Created Date: Jul 19 1978 12:00AM