DocumentCode
1754027
Title
Linear Programming Sensitivity Analysis for Saddle Point Algorithm
Author
Guoguang, Zhang ; Penghui, Li
Author_Institution
Sch. of Inf. Eng., Shenyang Univ. of Chem. Technol., Shenyang, China
Volume
1
fYear
2011
fDate
28-29 March 2011
Firstpage
171
Lastpage
173
Abstract
Saddle point algorithm is a new fast iterative method for linear programming, the program based on this algorithm has been widely used in many fields and shows better performance than other public domain programs. Sensitivity analysis is used to determine how the optimal solution is affected by changes, within specified ranges, in the objective function coefficients or the right-hand side values. In this paper, a new algorithm of the sensitivity analysis for the saddle point algorithm was provided. Found the range of optimality for the objective function coefficients and the right hand side values without changing the original optimal basis.
Keywords
iterative methods; linear programming; sensitivity analysis; iterative method; linear programming sensitivity analysis; objective function coefficients; optimal solution; saddle point algorithm; Algorithm design and analysis; Equations; IP networks; Linear programming; Matrix decomposition; Sensitivity analysis; linear programming; saddle point algorithm; sensitivity analysis;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Computation Technology and Automation (ICICTA), 2011 International Conference on
Conference_Location
Shenzhen, Guangdong
Print_ISBN
978-1-61284-289-9
Type
conf
DOI
10.1109/ICICTA.2011.51
Filename
5750583
Link To Document