PCx: an interior-point code for linear programming

1 January 1999

journal article
software
Published by Taylor & Francis in Optimization Methods and Software

Vol. 11 (1) , 397-430
https://doi.org/10.1080/10556789908805757

Abstract

We describe the code PCx, a primal-dual interior-point code for linear programming. Information is given about problem formulation and the underlying algorithm, along with instructions for installing, invoking, and using the code. Computational results on standard test problems are reported.

Keywords

This publication has 8 references indexed in Scilit:

Primal-Dual Interior-Point Methods
Published by Society for Industrial & Applied Mathematics (SIAM) ,1997
Multiple centrality corrections in a primal-dual method for linear programming
Computational Optimization and Applications, 1996
An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization
SIAM Journal on Matrix Analysis and Applications, 1994
Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
SIAM Journal on Scientific Computing, 1993
On the Implementation of a Primal-Dual Interior Point Method
SIAM Journal on Optimization, 1992
The Role of Elimination Trees in Sparse Factorization
SIAM Journal on Matrix Analysis and Applications, 1990
Modification of the minimum-degree algorithm by multiple elimination
ACM Transactions on Mathematical Software, 1985
On the Automatic Scaling of Matrices for Gaussian Elimination
IMA Journal of Applied Mathematics, 1972