4
Views
43
CrossRef citations to date
0
Altmetric
Technical Note

A Note on Shadow Prices in Linear Programming

Pages 425-431 | Published online: 20 Dec 2017

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (2)

Sjur Didrik Flåm. (2019) Generalized gradients, bid–ask spreads, and market equilibrium. Optimization 68:2-3, pages 579-592.
Read now
A. Ben-Israel & S.D. Flåm. (1989) Support prices of activities in linear programming , . Optimization 20:5, pages 561-579.
Read now

Articles from other publishers (41)

Tao Jie & Gao Yan. (2023) Directional shadow price in linearly constrained nonconvex optimization models. Journal of Global Optimization 88:2, pages 431-460.
Crossref
Sjur D. Flåm & Jan-J. Rückmann. (2022) The Lagrangian, constraint qualifications and economics. Mathematical Methods of Operations Research 96:2, pages 215-232.
Crossref
Seungnyun Kim, Junwon Son & Byonghyo Shim. (2021) Energy-Efficient Ultra-Dense Network Using LSTM-based Deep Neural Networks. IEEE Transactions on Wireless Communications 20:7, pages 4702-4715.
Crossref
Tao Jie & Gao Yan. (2021) Computing shadow prices with multiple Lagrange multipliers. Journal of Industrial & Management Optimization 17:5, pages 2307.
Crossref
Alejandro Crema. (2018) Generalized average shadow prices and bottlenecks. Mathematical Methods of Operations Research 88:1, pages 99-124.
Crossref
Joern Meissner & Olga V. Senicheva. (2018) Approximate dynamic programming for lateral transshipment problems in multi-location inventory systems. European Journal of Operational Research 265:1, pages 49-64.
Crossref
Jacek Wawrzosek & Szymon Ignaciuk. (2018) Postoptimization of the model of water supply for urban and industrial agglomeration. ITM Web of Conferences 23, pages 00035.
Crossref
Alwin Haensel & Ger Koole. (2013) Evaluating extraordinarily large requests in a revenue management environment. Journal of Revenue and Pricing Management 12:4, pages 320-338.
Crossref
Timon H. Stasko & H. Oliver Gao. (2012) Developing green fleet management strategies: Repair/retrofit/replacement decisions under environmental regulation. Transportation Research Part A: Policy and Practice 46:8, pages 1216-1226.
Crossref
G. Johnson, M. Ortiz & S. Leyendecker. (2012) A linear programming-based algorithm for the signed separation of (non-smooth) convex bodies. Computer Methods in Applied Mechanics and Engineering 233-236, pages 49-67.
Crossref
V. Lenzen, M. Lienert & F. Musgens. (2012) Political shocks and efficient investment in electricity markets. Political shocks and efficient investment in electricity markets.
Tamás Koltai & Viola Tatay. (2011) A practical approach to sensitivity analysis in linear programming under degeneracy for management decision making. International Journal of Production Economics 131:1, pages 392-398.
Crossref
Andreas Drexl & Wolfgang DomschkeWolfgang Domschke & Andreas Drexl. 2011. Einführung in Operations Research. Einführung in Operations Research 13 65 .
James J. Cochran, Louis A. CoxJr.Jr., Pinar Keskinocak, Jeffrey P. Kharoufeh & J. Cole SmithCarlo Filippi. 2011. Wiley Encyclopedia of Operations Research and Management Science. Wiley Encyclopedia of Operations Research and Management Science.
Shanshui Zheng. (2010) Resource shadow price calculation under long-term and short-term production. Resource shadow price calculation under long-term and short-term production.
Shanshui Zheng & Lihua Liu. (2010) In Production Operation How to Avoid the Misuse of Shadow Price: A Perspective of the Direction Derivation. In Production Operation How to Avoid the Misuse of Shadow Price: A Perspective of the Direction Derivation.
Alireza Tehrani Nejad Moghaddam. (2010) Allocating the CO2 emissions of an oil refinery with Aumann–Shapley prices: Comment. Energy Economics 32:1, pages 243-255.
Crossref
Mokhtar S. Bazaraa, John J. Jarvis & Hanif D. Sherali. 2009. Linear Programming and Network Flows. Linear Programming and Network Flows 681 732 .
Rahul Jain & Jean Walrand. (2008) An Efficient Mechanism for Network Bandwidth Auction. An Efficient Mechanism for Network Bandwidth Auction.
Jan Stallaert. (2007) Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm. Computers & Operations Research 34:7, pages 1871-1884.
Crossref
Wolfgang Domschke & Robert Klein. (2004) Bestimmimg von Opportunitätskosten am Beispiel des Produktionsconti oilingCalculating Opportunity Cost in Production Planning. Zeitschrift für Planung & Unternehmenssteuerung 15:3, pages 275-294.
Crossref
Katta G. Murty. 2001. Encyclopedia of Optimization. Encyclopedia of Optimization 284 290 .
Vivek Dua & Efstratios N. Pistikopoulos. 2001. Encyclopedia of Optimization. Encyclopedia of Optimization 1948 1951 .
Tamás Koltai & Tamás Terlaky. (2000) The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming. International Journal of Production Economics 65:3, pages 257-274.
Crossref
M. Madrigal & V.H. Quintana. (2000) Using optimization models and techniques to implement electricity auctions. Using optimization models and techniques to implement electricity auctions.
M. Madrigal & V.H. Quintana. (2000) Degeneracy and duality gap on optimization-based electricity auctions. Degeneracy and duality gap on optimization-based electricity auctions.
B. Jansen, J.J. de Jong, C. Roos & T. Terlaky. (1997) Sensitivity analysis in linear programming: just be careful!. European Journal of Operational Research 101:1, pages 15-28.
Crossref
Tomas Gal. 1997. Advances in Sensitivity Analysis and Parametric Programming. Advances in Sensitivity Analysis and Parametric Programming 122 157 .
Masatoshi SAKAWA, Masahiro INUIGUCHI, Kosuke KATO & Tomohiro IKEDA. (1996) An Interactive Fuzzy Satisficing Method for Multiobjective Optimal Control Problems in Linear Distributed-Parameter Systems. Journal of Japan Society for Fuzzy Theory and Systems 8:5, pages 834-842.
Crossref
Benjamin Jansen, Cornelis Roos & Tamás Terlaky. 1996. Interior Point Methods of Mathematical Programming. Interior Point Methods of Mathematical Programming 3 34 .
Alejandro Crema. (1995) Average shadow price in a mixed integer linear programming problem. European Journal of Operational Research 85:3, pages 625-635.
Crossref
Hermann-Josef Kruse. (1993) On some properties of o-degeneracy graphs. Annals of Operations Research 46-47:2, pages 393-408.
Crossref
Tomas Gal. (1993) Degeneracy graphs: theory and application an updated survey. Annals of Operations Research 46-47:1, pages 81-105.
Crossref
Tomas Gal. (1993) Selected bibliography on degeneracy. Annals of Operations Research 46-47:1, pages 1-7.
Crossref
Tomas Gal & Ferdinand Geue. (1992) A new pivoting rule for solving various degeneracy problems. Operations Research Letters 11:1, pages 23-32.
Crossref
James E. Ward & Richard E. Wendell. (1990) Approaches to sensitivity analysis in linear programming. Annals of Operations Research 27:1, pages 3-38.
Crossref
Tomas Gal. 1990. Papers of the 18th Annual Meeting / Vorträge der 18. Jahrestagung. Papers of the 18th Annual Meeting / Vorträge der 18. Jahrestagung 499 506 .
Gabriele Piehler. 1990. Papers of the 18th Annual Meeting / Vorträge der 18. Jahrestagung. Papers of the 18th Annual Meeting / Vorträge der 18. Jahrestagung 521 528 .
J. S. H. Kornbluth. 1987. Toward Interactive and Intelligent Decision Support Systems. Toward Interactive and Intelligent Decision Support Systems 196 210 .
Harvey J. Greenberg. (2006) An analysis of degeneracy. Naval Research Logistics Quarterly 33:4, pages 635-655.
Crossref
T. Gal. (1986) Shadow prices and sensitivity analysis in linear programming under degeneracy. Operations-Research-Spektrum 8:2, pages 59-71.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.