[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
glpk 1.1.1 release information
From: |
Andrew Makhorin |
Subject: |
glpk 1.1.1 release information |
Date: |
Fri, 15 Dec 2000 20:39:53 +0300 |
GLPK 1.1.1 -- Release information
=================================
Release date: Dec 14, 2000
GLPK (GNU Linear Programming Kit) is a library of ANSI C routines for
solving large scale linear programming problems by means of the revised
simplex method.
GLPK implements the following main features:
* application program interface (API);
* sparse matrix technique;
* sparse gaussian elimination based on Markowitz strategy and Duff
search technique;
* elimination form of the inverse (EFI);
* Reid form of the inverse (RFI) provided with Bartels-Golub and
Forrest-Tomlin updating techniques;
* steepest edge pricing (for both primal and dual simplex);
* Harris two-pass pivoting technique (for both primal and dual simplex);
* reading and writing LP problem data using MPS format.
GLPK has been successfully tested on a large set of real LP problems, in
particular, on the famous collection of test LP problems from Netlib.
Two changes were made in the previous version of the package:
* minor bug was fixed in 'Makefile.in';
* the User's Guide and the Library Reference were included into the
distribution (only in texinfo format).
Please note that the current version of GLPK is *tentative*.
See the official GNU web page about GLPK at
<http://www.gnu.org/software/glpk/glpk.html>
GLPK distribution (428K) and the documentation (in Postscript format)
can be ftp'ed from <ftp://ftp.gnu.org/gnu/glpk/> or from some mirror GNU
site (see <http://www.gnu.org/order/ftp.html>)
You can also visit the author's web page dedicated to GLPK at
<http://mai2.rcnet.ru/~mao/glpk/index.htm> (please note that the server
mai2.rcnet.ru works unstably, therefore sometimes that web page is not
available)
HAPPY NEW YEAR AND NEW MILLENNIUM !!! :+)
[Prev in Thread] |
Current Thread |
[Next in Thread] |
- glpk 1.1.1 release information,
Andrew Makhorin <=