Computing True Shadow Prices in Linear Programming
Volume 11, Issue 4 (2000), pp. 421–434
Pub. online: 1 January 2000
Type: Research Article
Received
1 August 2000
1 August 2000
Published
1 January 2000
1 January 2000
Abstract
It is well known that in linear programming, the optimal values of the dual variables can be interpreted as shadow prices (marginal values) of the right-hand side coefficients. However, this is true only under nondegeneracy assumptions. Since real problems are often degenerate, the output from conventional LP software regarding such marginal information can be misleading. This paper surveys and generalizes known results in this topic and demonstrates how true shadow prices can be computed with or without modification to existing software.