PCx PCx is a primal-dual interior-point code for linear programming. It implements Mehrotra's predictor-corrector algorithm, the algorithm that forms the basis of most existing interior-point codes for general linear programming. The major computational operation--solution of a linear system with a large, sparse positive definite coefficient matrix--is performed with the sparse Cholesky package of Ng and Peyton, with minor modifications to handle small pivot elements.

Current Version:   1.0 License Type:   Free for Non-Commercial and Research Use, http://www.mcs.anl.gov/otc/Tools/PCx/copyright.html

Home Site: http://www.mcs.anl.gov/otc/Tools/PCx/ Source Code Availability: Yes Available Binary Packages: Debian Package:   Yes (in the non-free section) RedHat RPM Package:   No Other Packages:   Yes, (from Home Site) Targeted Platforms: SunOS, Solaris, AIX, IRIX-5.3, HPUX, Linux, DEC Alpha. Software/Hardware Requirements: None

Other Links: None Mailing Lists/USENET News Groups: None User Comments: None See A Screen Shot?

  SAL Home   |   Numerical Analysis   |   Optimization