Computational experience with a primal-dual interior point method for linear programming

Linear Algebra and Its Applications

Volumn 152, Issue C, 1991, Pages 191-222

  Lustig, Irvin J ^a   Marsten, Roy E ^b   Shanno, David F ^c  

^a PRINCETON UNIVERSITY   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c the State University of New Jersey   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000114112     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/0024-3795(91)90275-2     Document Type: Article

References (18)

1. An implementation of Karmarkar's algorithm for linear programming
2. Analysis of mathematical programming problems prior to applying the simplex method
3. Further Development of a Primal-Dual Interior Point Method
4. Electronic mail distribution of linear programming test problems
5. A Single-Phase Dual Barrier Method for Linear Programming
6. 3L) Operations
7. A primal-dual interior point algorithm for linear programming
8. Modification of the minimum-degree algorithm by multiple elimination
9. Feasibility Issues in an Interior Point Method for Linear Programming
10. The Formulation of Stochastic Programs for Interior Methods
11. Primal Barrier Methods for Linear Programming
12. Implementation of a dual affine interior point algorithm for linear programming
13. An Implementation of a primal-dual interior point method for linear programming
14. Pathways to the optimal set in linear programming
15. Interior path following primal-dual algorithms. Part I: Linear programming
16. A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Programming, and for Power Series Extension