| Paketname | pcx |
| Beschreibung | primal-dual interior-point code for linear programming |
| Archiv/Repository | Offizielles Debian Archiv squeeze (non-free) |
| Version | 1.1.18-2+b1 |
| Sektion | non-free/math |
| Priorität | optional |
| Installierte Größe | 664 Byte |
| Hängt ab von | libc6 (>= 2.3), libgcc1 (>= 1:4.1.1), libgfortran3 (>= 4.3) |
| Empfohlene Pakete | |
| Paketbetreuer | James R. Van Zandt |
| Quelle | pcx (1.1.18-2) |
| Paketgröße | 310372 Byte |
| Prüfsumme MD5 | 452c6111fcc1a6d64fcd0bc4f3e1b851 |
| Prüfsumme SHA1 | 6c501f5f9fcf15fba1518524c6412075f212b9c7 |
| Prüfsumme SHA256 | e8ab58e875dc761191d8b254c7f4dc1b0bbdef96358b130546c9f11861933f43 |
| Link zum Herunterladen | pcx_1.1.18-2+b1_i386.deb |
| Ausführliche Beschreibung | 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.
|