Archive for June 2010
It has been a while since my last post… sorry ’bout that. I am already feeling like just announcing new glpk releases etc. It is not that there are not enough issues that deserve attention but it seems to me like each one of them has such a political or controversial component that I am not sure that I want to touch them (e.g., editors forcing citations of their journal, ethical misconduct to sustain growth). Some of them have been lurking in my drafts folder for a while now and still haven’t made up my mind. I hope I will find some more time soon to write more elaborate posts more frequently.
Anyways, a new version of glpk has been released. The new version now allows for explicit querying of dual values within the GMPL language.
GLPK 4.44 Release Information
Release date: Jun 03, 2010
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.
The following suffixes for variables and constraints were
implemented in the MathProg language:
.lb (lower bound),
.ub (upper bound),
.status (status in the solution),
.val (primal value), and
.dual (dual value).
Thanks to Xypron <email@example.com> for draft implementation
Now the MathProg language allows comment records (marked by
‘#’ in the very first position) in CSV data files read with the
table statements. Note that the comment records may appear only
in the beginning of a CSV data file.
The API routine glp_cpp to solve the Critical Path Problem was
added and documented.
See GLPK web page at <http://www.gnu.org/software/glpk/glpk.html>.
MD5 check-sum is the following:
GLPK is also available as a Debian GNU/Linux package. See its web page
For MS Windows users there is also available GLPK Lab, a set of free
software tools and libraries based on the GLPK package. Its web page
can be found at <http://glpklabw.sourceforge.net/>. Thanks to Xypron
<firstname.lastname@example.org> and Luiz Bettoni <email@example.com>