A steepest edge active set algorithm for solving sparse linear programming problems

1988 ◽  
Vol 26 (12) ◽  
pp. 2671-2685 ◽  
Author(s):  
S. W. Sloan
1988 ◽  
Vol 110 (1) ◽  
pp. 58-64 ◽  
Author(s):  
Heng Long Li ◽  
Panos Papalambros

A new algorithm for linear programming problems is presented. The algorithm makes interior moves with a special active set strategy that utilizes both local and global knowledge. This knowledge represents primarily monotonicity and dominance information. The article describes the rationale, theory, implementation, and some test examples for the algorithm. The ideas presented form the basis for nonlinear programming extensions in sequel articles.


2012 ◽  
Vol 3 (4) ◽  
pp. 1-6 ◽  
Author(s):  
M.Jayalakshmi M.Jayalakshmi ◽  
◽  
P.Pandian P.Pandian

Sign in / Sign up

Export Citation Format

Share Document