A Note on Shadow Prices in Linear Programming

DOI10.2307/2581371zbMath0532.90064OpenAlexW4235911102MaRDI QIDQ3315273

Mustafa Akgül

Publication date: 1984

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2581371

zbMATH Keywords

convex analysisshadow pricesparametric linear programming

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)

Related Items

Generalized average shadow prices and bottlenecks, Survey of solved and open problems in the degeneracy phenomenon, Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm, Average shadow price in a mixed integer linear programming problem, Computing shadow prices with multiple Lagrange multipliers, Approximate dynamic programming for lateral transshipment problems in multi-location inventory systems, Directional shadow price in linearly constrained nonconvex optimization models, Informative Lagrange multipliers in nonlinear parametric programming models, Generalized gradients, bid–ask spreads, and market equilibrium, A new pivoting rule for solving various degeneracy problems, Weakly redundant constraints and their impact on postoptimal analyses in LP, A linear programming-based algorithm for the signed separation of (non-smooth) convex bodies, Approaches to sensitivity analysis in linear programming, Sensitivity analysis in linear programming: Just be careful!, The Lagrangian, constraint qualifications and economics, Selected bibliography on degeneracy, Degeneracy graphs: Theory and applications. An updated survey, Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey