GLPK 4.38 released
A new version of the GNU Linear Programming Kit has been released. The version 4.38 includes a few improvements in the dual simplex routines and two new packages were included into the interior-point solver for reordering the matrices prior to the Cholesky factorization (for more information see SuiteSparse). Expect a new version of GUSEK soon including the new glpsol executable.
Release date: May 02, 2009
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 as a callable library.
In this release:
API routines glp_read_mps and glp_write_mps were improved.
Some improvements were made in the dual simplex routines.
Two external software modules AMD and COLAMD were included in
the distribution (for more details please see src/amd/README
and src/colamd/README). Now they are used in the interior-point
solver to reorder the matrix prior to Cholesky factorization.
API routine glp_ipt_status may return two new statuses due to
changes in the routine glp_interior. For details please see the
reference manual included in the distribution.
A minor bug was fixed in the graph/network routines. Thanks to
Nelson H. F. Beebe <email@example.com> for bug report.
See GLPK web page 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 ftp sites; see <http://www.gnu.org/order/ftp.html>.