ON THE PROPERTIES OF ∊-SENSITIVITY ANALYSIS FOR LINEAR PROGRAMMING

Abstract

∊-Sensitivity analysis (∊-SA) is a kind of method to perform sensitivity analysis for linear programming. Its main advantage is that it can be directly applied for interior-point methods with a little computation. In this paper, we discuss the property of ∊-SA analysis and its relationship with other sensitivity analysis methods. First, we present a new property of ∊-SA, from which we derive a simplified formula for finding the characteristic region of ∊-SA. Next, based on the simplified formula, we show that the characteristic region of ∊-SA includes the characteristic region of Yildirim and Todd's method. Finally, we show that the characteristic region of ∊-SA asymptotically becomes a subset of the characteristic region of sensitivity analysis using optimal partition. Our results imply that ∊-SA can be used as a practical heuristic method for approximating the characteristic region of sensitivity analysis using optimal partition.