Weakly redundant constraints and their impact on postoptimal analyses in LP

DOI10.1016/0377-2217(92)90083-LzbMath0762.90049OpenAlexW1993620023MaRDI QIDQ1199513

Tomas Gal

Publication date: 16 January 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90083-l

zbMATH Keywords

sensitivity analysisdegeneracydegeneracy graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)

Related Items (8)

Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm ⋮ Consistency, redundancy, and implied equalities in linear systems ⋮ A global tolerance approach to sensitivity analysis in linear programming ⋮ Sensitivity analysis of the optimal assignment. ⋮ Selected bibliography on degeneracy ⋮ Degeneracy graphs: Theory and applications. An updated survey ⋮ An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex ⋮ SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM

Cites Work

• Unnamed Item
• Unnamed Item
• Redundancy in mathematical programming. A state-of-the-art survey
• On the structure of the set bases of a degenerate point
• Degeneracy graphs and the neighbourhood problem
• Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
• A new pivoting rule for solving various degeneracy problems
• A Note on Shadow Prices in Linear Programming
• An analysis of degeneracy
• Zur Identifikation redundanter Nebenbedingungen in linearen Programmen

This page was built for publication: Weakly redundant constraints and their impact on postoptimal analyses in LP