[Help-glpk] GLPK 3.0.4 Release Information

[Andrew Makhorin]

GLPK 3.0.4 -- Release Information
*********************************

Release date: Dec 10, 2001

GLPK (GNU Linear Programming Kit) is intended for solving large-scale
linear programming (LP), mixed integer linear programming (MIP), and
other related problems. It is a set of routines written in ANSI C and
organized in the form of a callable library.

A new, more efficient implementation of the two-phase primal simplex
method was included in the package. Due to some new features (advanced
initial basis, projected steepest edge, recursive updating values and
reduced costs) the new LP solver is faster and numerically more stable
than the old one.

The new LP solver is available as API routine glp_simplex2 and can be
used in the same way as API routine glp_call_rsm1. For detailed
specification see the file 'newapi.txt' in the subdirectory 'doc' in
the distribution.

Now the new LP solver is also used by default to solve an initial LP
problem in the branch-and-bound routine glp_call_bbm1 instead the
routine rsm1_driver. Nevertheless the branch-and-bound procedure itself
is still based on rsm1_driver.

The new LP solver is also used as default solver in GLPSOL. In order to
choose the old solver the option '--old-sim' should be specified in the
command line.

Some bench-marks of the new LP solver are shown in the file 'bench.txt'
included in the subdirectory 'doc' in the distribution.

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 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>).

GLPK package is also available as Debian/GNU Linux package. See the web
page at <http://packages.debian.org/unstable/math/glpk.html>.