Bug#636415: O: pcx -- primal-dual interior-point code for linear programming
Package: wnpp
Severity: normal
The current maintainer of pcx, James R. Van Zandt <jrv@debian.org>,
is apparently not active anymore. Therefore, I orphan this package now.
Maintaining a package requires time and skills. Please only adopt this
package if you will have enough time and attention to work on it.
If you want to be the new maintainer, please see
http://www.debian.org/devel/wnpp/index.html#howto-o for detailed
instructions how to adopt a package properly.
Some information about this package:
Package: pcx
Binary: pcx
Version: 1.1.18-2
Maintainer: James R. Van Zandt <jrv@debian.org>
Build-Depends: debhelper (>= 4.0), csh | c-shell, gfortran
Architecture: any
Standards-Version: 3.8.0
Format: 1.0
Files:
86242364ebdf4033daa4e990261d670e 1095 pcx_1.1.18-2.dsc
ea6723ee9f10a88b01a66375a14c7738 449878 pcx_1.1.18.orig.tar.gz
eff514ec5c476a6a9e6bdf2c14bef397 14276 pcx_1.1.18-2.diff.gz
Checksums-Sha1:
891e73a1e824341914e042fc2a1684f40e521aac 1095 pcx_1.1.18-2.dsc
b4fc73c4703cb327589cc3415179e4192cf7284e 449878 pcx_1.1.18.orig.tar.gz
acba4b85236aeb99906fa3b4fbd2dc2edc9a089a 14276 pcx_1.1.18-2.diff.gz
Checksums-Sha256:
eb43857ec2f06bbc0f902f30cb88c9bafa6c65bd82fce3a06dee90cdaca86bb8 1095 pcx_1.1.18-2.dsc
a46607d65282ddc0e7874ee8d661582f32a1f1bc85d57ce634e72937ec151856 449878 pcx_1.1.18.orig.tar.gz
759b7fe1047107859f25f1f6dbd73cecf3fd084de41420e3ae57c00e4e04a45f 14276 pcx_1.1.18-2.diff.gz
Homepage: http://www.mcs.anl.gov/otc/Tools/PCx/
Directory: pool/non-free/p/pcx
Priority: source
Section: non-free/math
Package: pcx
Source: pcx (1.1.18-2)
Version: 1.1.18-2+b1
Installed-Size: 816
Maintainer: James R. Van Zandt <jrv@debian.org>
Architecture: amd64
Depends: libc6 (>= 2.3), libgcc1 (>= 1:4.1.1), libgfortran3 (>= 4.3)
Description: primal-dual interior-point code for linear programming
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.
Homepage: http://www.mcs.anl.gov/otc/Tools/PCx/
Section: non-free/math
Priority: optional
Filename: pool/non-free/p/pcx/pcx_1.1.18-2+b1_amd64.deb
Size: 361074
MD5sum: 780838a2a6f0ab488be8477035b4011d
SHA1: 89e773a7680879ed3c340e6dc69878e3ae5662ce
SHA256: d62e4c70c9ca94c0d7c334a30ce193704ab8350acd5966feac73158a54b8202e
Reply to: