Skip to main content
Log in

Shadow prices and sensitivity analysis in linear programming under degeneracy

State-of-the-art-survey

  • Survey
  • Published:
Operations-Research-Spektrum Aims and scope Submit manuscript

Summary

In linear programming applications the economic meaning of shadow prices is important. In the case primal degeneracy occurs in the optimal solution, the values of the dual real variables are not, in general, identical with the corresponding shadow prices, or, in other words, these values have not the usual meaning in comparison with LP optimal solutions without primal degeneracy. Several proposals on how to interpret such values or how to find the “true” shadow prices have been made and terms like “many-sided-” or “two-sided-shadowprices” have been coined. Also, when performing sensitivity analysis in the case primal degeneracy occurs, the so called critical ranges of the right hand side or of the objective function coefficients cannot be determined in the usual way. In this paper, a state-of-the-art-survey on these questions is given.

Zusammenfassung

Bei den Anwendungen der linearen Optimierung ist der ökonomische Inhalt der Schattenpreise von Bedeutung. Falls eine optimale Lösung primal entartet ist, sind die Werte der dualen Strukturvariablen im allgemeinen nicht identisch mit den entsprechenden Schattenpreisen, oder — anders ausgedrückt — diese Werte kann man nicht so interpretieren wie bei nichtentarteten optimalen Lösungen eines linearen Optimierungsproblems. Es gibt in der Literatur verschiedene Vorschläge, wie diese Werte interpretiert werden sollen oder wie der „richtige“ Schattenpreis bestimmt werden soll. Dabei werden Bezeichnungen wie „vielseitige“ bzw. „zweiseitige Schattenpreise“ eingeführt. Auch bei der Durchführung einer Sensitivitätsanalyse können im Falle einer primalen Entartung die kritischen Bereiche für Parameter in der rechten Seite oder in den Zielkoeffizienten nicht auf die übliche Weise bestimmt werden. In diesem Artikel ist eine Übersicht des gegenwärtigen Standes zu den obigen Problemen gegeben.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Akgül M (1984) A note on shadow prices in linear programming. J Oper Res 35:425–431

    Article  Google Scholar 

  2. Aucamp DC, Steinberg DI (1982) The computation of shadow prices in linear programming. J Oper Res Soc 33: 557–565

    Article  Google Scholar 

  3. Aucamp DC, Steinberg DI (1978) On the nonequivalence of shadow prices and dual variables. Presented at The TIMS/ ORSA meeting, Los Angeles, Nov. 1978; Techn. Rep. WUCS-79-11, Washington University Department of Computer Sciences, St. Luis Missouri

    Google Scholar 

  4. Bank B, Guddat J, Klatte D, Kummer B, Tammer K (1982) Non-linear parametric optimization. Akademie Verlag, Berlin

    Book  Google Scholar 

  5. Ben-Israel A, Flåm SD (1985) Canonical Bases and Sensitivity Analysis in linear programming. Research Report, Department of Mathematical Science, University of Delaware, Newark, and Department of Science and Technology, Chr. Michelsen Institut, Fantoft, Norway

    Google Scholar 

  6. Bland RG (1977) New finite pivoting rules for the simplex method. Math OR 2:103–107

    Article  Google Scholar 

  7. Chang Y-Y, Cottle RW (1978) Least index resolution of degeneracy in quadratic programming. Techn. Rep. 78-3, Stanford University Department of OR, California

    Google Scholar 

  8. Charnes A (1952) Optimality and degeneracy in linear programming. Econometrica 20:150–170

    Google Scholar 

  9. Cook TG, Russel RH (1977) Introduction to management science. Prentice Hall, Englewood Cliffs, NJ

    Google Scholar 

  10. Dantzig GB (1963) Linear programming and extensions. Princeton University Press, Princeton

    Book  Google Scholar 

  11. Dantzig GB, Orden A, Wolfe P (1955) Generalized simplex method for minimizing a linear form under linear inequality restraints. Pac J Math 5:183–195

    Article  Google Scholar 

  12. Eilon A, Flavell R (1974) Note on “many-sided shadow prices”. OMEGA 2:821–823

    Article  Google Scholar 

  13. Evans JR, Baker NR (1982) Degeneracy and the (mis) interpretation of sensitivity analysis in linear programming. Decision Sci 13:348–154

    Article  Google Scholar 

  14. Gal T (1979) Postoptimal analyses, parametric programming and related topics. McGraw Hill, New York Berlin

    Google Scholar 

  15. Gal T (1985) On the structure of the set bases of a degenerate point. JOTA 45:577–589

    Article  Google Scholar 

  16. Gass SI (1969) Linear programming — Methods and applications, 3rd edn. McGraw Hill, New York

    Google Scholar 

  17. Hadley G (1960) Linear algebra. Addison-Wesley, Reading, Mass

    Google Scholar 

  18. Karwan MH, Lotfi V, Teigen J, Zionts S (1983) Redundancy in mathematical programming. Lecture Notes in Economics and Mathematical Systems, vol 206. Springer, Berlin Heidelberg New York

    Google Scholar 

  19. Knolmayer G (1976) How many-sided are shadow prices at degenerate primal optima? OMEGA 4:493–494

    Article  Google Scholar 

  20. Knolmayer G (1980) Programmierungsmodelle für die Produktionsprogrammplanung. Birkhäuser, Basel Boston Stuttgart

    Book  Google Scholar 

  21. Knolmayer G (1984) The effect of degeneracy on cost-coefficient ranges and an algorithm to resolve interpretation problems. Decision Sci 15:14–21

    Article  Google Scholar 

  22. Kruse H-J (1986) Degeneracy graphs and the neighbourhood problem. Lecture Notes in Economics and Mathematical Systems, vol 3. Springer, Berlin Heidelberg New York

    Google Scholar 

  23. Menger C (1871) Grundsätze der Volkswirtschaftslehre. Wien

  24. Müller-Merbach H (1973) Operations research, 3rd edn. Franz Vahlen, München

    Google Scholar 

  25. Panne C van de (1975) Methods for linear and quadratic programming. North Holland, Amsterdam

    Google Scholar 

  26. Saaty TL (1959) Coefficient perturbation of a constrained extremum. Oper Res 7:294–302

    Article  Google Scholar 

  27. Samuelson PA (1950) Frank Knight's theorem in linear programming. D-782, The RAND Corporation

  28. Shapiro JF (1979) Mathematical programming: Structures and algorithms, chap 2.4. J. Wiley, New York

    Google Scholar 

  29. Stigler GJ (1941) Production and distribution theories, chap VI–VII. New York

  30. Strum JE (1969) Note on two-sided shadow prices. J Account Res 7:160–162

    Article  Google Scholar 

  31. Uzawa H (1958) A note on the Menger-Wieser-Theory of imputation. Nationalökonomie 18:318–334

    Article  Google Scholar 

  32. Wagner H (1969) Principles of operations research. Prentice Hall, Englewood Cliffs, NJ

    Google Scholar 

  33. Wieser F von (1889) Der natürliche Wert

  34. Williams AC (1963) Marginal values in linear programming. J Soc Indust Appl Math 11:82–94

    Article  Google Scholar 

  35. Wolfe P (1963) A technique for resolving degeneracy in linear programming. J Soc Indust Appl Math 11:205–211

    Article  Google Scholar 

  36. Wright FK (1968) Measuring asset services: a linear programming approach. J Account Res 6:222–236

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gal, T. Shadow prices and sensitivity analysis in linear programming under degeneracy. OR Spektrum 8, 59–71 (1986). https://doi.org/10.1007/BF01719736

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01719736

Keywords

Navigation