1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
|
Source: pcx
Section: non-free/math
Priority: optional
Maintainer: James R. Van Zandt <jrv@debian.org>
Build-Depends: debhelper, c-shell
Standards-Version: 3.5.2
Package: pcx
Architecture: any
Depends: ${shlibs:Depends}
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. For more information, see
http://www.mcs.anl.gov/otc/Tools/PCx/.
|
