|
|
|
pcx
primal-dual interior-point code for linear programming
/Main/Debian/mips/non-free/math/PCx is a freely available 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 (Oak Ridge National Laboratory), with minor modifications to handle small pivot elements. PCx does not solve integer programming problems. For more information, see http://www.mcs.anl.gov/otc/Tools/PCx/.Info:
Homepage: - Package version: 1.1.17-3.1 Architecture: mips Distribution: Debian Filename: pcx_1.1.17-3.1_mips.deb Browse inside pcx_1.1.17-3.1_mips.deb:
pkg://pcx_1.1.17-3.1_mips.deb:322154/ downloads932 B 2008-03-18control view 460+ mirrors
1.85 KB 2008-03-18md5sums view 23 mirrors
1.32 KB 2008-03-18postinst view 148 mirrors
905 B 2008-03-18prerm view 22 mirrors
[DIR]usr/ 1000+ twin directoriesDownload pcx_1.1.17-3.1_mips.deb:
2008-03-20 ftp://ftp.inf.tu-dresden.de/os/linux/dists/debian/debian/pool/non-free/p/pcx/pcx_1.1.17-3.1_mips.deb
2008-03-20 ftp://ftp.de.freebsd.org/pub/debian/pool/non-free/p/pcx/pcx_1.1.17-3.1_mips.deb
2008-03-20 ftp://ftp.nrc.ca/pub/systems/linux/debian.org/debian/pool/non-free/p/pcx/pcx_1.1.17-3.1_mips.deb
2008-03-20 ftp://192.87.102.42/vol/4/linux-debian/pool/non-free/p/pcx/pcx_1.1.17-3.1_mips.deb
| Results 1 - 1 |