scholarly journals Sensitivity analysis in linear programming and semidefinite programming using interior-point methods

2001 ◽  
Vol 90 (2) ◽  
pp. 229-261 ◽  
Author(s):  
E. Alper Yıldırım ◽  
Michael Todd
2005 ◽  
Vol 22 (02) ◽  
pp. 135-151 ◽  
Author(s):  
CHAN-KYOO PARK ◽  
WOO-JE KIM ◽  
SOONDAL PARK

∊-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.


2002 ◽  
Vol 12 (3) ◽  
pp. 782-810 ◽  
Author(s):  
E. Alper Yildirim ◽  
Stephen J. Wright

1994 ◽  
Vol 6 (1) ◽  
pp. 35-36 ◽  
Author(s):  
Irvin J. Lustig ◽  
Roy E. Marsten ◽  
David F. Shanno

Sign in / Sign up

Export Citation Format

Share Document