The Computation of Shadow Prices in Linear Programming
From MaRDI portal
Publication:3942740
DOI10.2307/2581039zbMath0483.90061OpenAlexW4231209913MaRDI QIDQ3942740
David I. Steinberg, Donald C. Aucamp
Publication date: 1982
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2581039
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, A linear programming-based algorithm for the signed separation of (non-smooth) convex bodies, Approaches to sensitivity analysis in linear programming, Selected bibliography on degeneracy, Degeneracy graphs: Theory and applications. An updated survey, On some properties of \(0\)-degeneracy graphs, A set partitioning heuristic for the generalized assignment problem, Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
