Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm

DOI10.1016/j.cor.2005.07.018zbMath1187.90193OpenAlexW2029663470MaRDI QIDQ868125

Jan I. A. Stallaert

Publication date: 19 February 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.07.018

zbMATH Keywords

simplex methodshadow prices

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Extreme-point and pivoting methods (90C49)

Related Items (1)

Multiparametric linear programming: support set and optimal partition invariancy

Cites Work

• Unnamed Item
• Unnamed Item
• A compact formulation of an elastoplastic analysis problem
• A geometric view of parametric linear programming
• Weakly redundant constraints and their impact on postoptimal analyses in LP
• Sensitivity analysis in linear programming: Just be careful!
• Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces
• Degeneracy graphs: Theory and applications. An updated survey
• Advances in sensitivity analysis and parametric programming
• A Note on Shadow Prices in Linear Programming
• On the average length of lexicographic paths
• An analysis of degeneracy
• The Computation of Shadow Prices in Linear Programming
• The factorization approach to large-scale linear programming
• Simultaneous Primal-Dual Right-Hand-Side Sensitivity Analysis from a Strictly Complementary Solution of a Linear Program
• Duality Theory of Linear Programs: A Constructive Approach with Applications
• Sensitivity analysis in linear programming and semidefinite programming using interior-point methods

This page was built for publication: Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm