Matrix Sensitivity Analysis from an Interior Solution of a Linear Program

DOI10.1287/ijoc.11.3.316zbMath0973.90049OpenAlexW2164159118MaRDI QIDQ4950949

Harvey J. Greenberg

Publication date: 5 December 2001

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/bae0ba2c1f26a5dbede389b7814053d728a90e28

zbMATH Keywords

sensitivity analysisminimax theoremlinear program

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Linear programming (90C05) Interior-point methods (90C51)

Related Items (6)

Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Parametric mixed-integer 0-1 linear programming: The general case for a single parameter ⋮ The asymptotic optimal partition and extensions of the nonsubstitution theorem ⋮ Matrix Perturbation and Optimal Partition Invariancy in Linear Optimization

This page was built for publication: Matrix Sensitivity Analysis from an Interior Solution of a Linear Program