./math/glpk, Library for solving linear programming problems

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]

Branch: CURRENT, Version: 4.63, Package name: glpk-4.63, Maintainer: adam

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

GLPK includes the following main components:

* implementation of the primal/dual simplex method;

* implementation of the primal-dual interior point method;

* implementation of the branch-and-bound procedure (based on the dual
simplex method);

* application program interface (API);

* GLPK/L, a modeling language intended for writing LP/MIP models;

* GLPSOL, a stand-alone program intended for solving LP/MIP problems
either prepared in the MPS format or written in the GLPK/L modeling

Required to run:

Required to build:

Master sites: (Expand)

SHA1: 8552ecdde601f94552e981eabfb84aa450b82d36
RMD160: ff178d3f85db0ed4c0b417b23fdd57474b574938
Filesize: 4034.948 KB

Version history: (Expand)

CVS history: (Expand)

   2017-08-18 23:47:51 by Adam Ciarcinski | Files touched by this commit (3)
Log message:
GLPK 4.63:

A "smart" LP perturbation was implemented in the primal and
dual simplex solvers. Now LP is perturbed only if it is
necessary, and by default perturbation is not activated.
The sum of primal infeasibilites that appears in the terminal
output of the primal simplex solver (as "inf = ...") now
corresponds to the original bounds of variables. This allows to
see how much perturbed solution violates the original bounds.

The long-step technique was implemented for phase I of the
primal simplex solver. This feature can be enabled by
specifying --flip option for glpsol or by specifying
glp_smcp.r_test = GLP_RT_FLIP on api level. For many LP
instances the long-step technique allows reducing the number
of simplex iterations to 30-70%. Please note that unlike the
dual simplex, where this technique can be used on both phase I
and II, for the primal simplex it can be used only on phase I,
where the sum of primal infeasibilities (which is a convex
piecewise linear function) is minimized.

An internal objective scaling was included in both primal and
dual simplex solvers. For many LP/MIP instances this feature
improves numerical stability (for the dual solver) and prevents
cycling near the optimum (for the primal solver).

The Posix version of glp_time (glpk/src/env/time.c) was changed
to resolve time_t issue on msys2.

Three new example models in MathProg were added:
life_goe.mod (Conway's Game of Life garden of eden checker);
tiling.mod (Rectifiable polyomino tilings generator);
toto.mod (Covering code generator).
   2017-01-25 11:02:17 by Adam Ciarcinski | Files touched by this commit (3)
Log message:
GLPK 4.61 (42:0:2) has been released.

The following modules were renamed to simplify maintenance.
* src/prob.h     RENAMED            -> src/api/prob.h
* src/glpapi01.c RENAMED            -> src/api/prob1.c
* src/glpapi02.c RENAMED            -> src/api/prob2.c
* src/glpapi03.c RENAMED            -> src/api/prob3.c
* src/glpapi04.c RENAMED            -> src/api/prob4.c
* src/glpapi05.c RENAMED            -> src/api/prob5.c

* src/env/tls.c
TLS (thread local storage class specifier) option was added;
see comments in tls.c for details.

* configure.ac, config.h.in
Test for TLS was added.

* src/env/tls.c
Dll support was added.

The following modules were changed to add __cdecl specifier
for functions passed to qsort (this is needed only on compiling
GLPK with MSVC to run under MS Windows).
* src/api/cpxbas.c
* src/cglib/cfg1.c
* src/cglib/gmigen.c
* src/cglib/mirgen.c
* src/misc/wclique1.c
* src/simplex/spychuzc.c
* src/glpios10.c
* src/glpios11.c
* examples/glpsol.c

* src/glpk.h, src/env/env.c
The API routine glp_version was changed to avoid initialization
of the GLPK environment. The new API routine glp_config was
added (but not documented yet).

Description of the configure option '--with-zlib' was removed.
   2016-04-12 23:40:47 by Adam Ciarcinski | Files touched by this commit (3)
Log message:
GLPK 4.60:

Some improvements were made in the primal and dual simplex
solvers to make the solution process more numerically stable.

An experimental long-step ratio test feature was added to the
dual simplex. On API level this feature is available thru the
GLP_RT_FLIP option. For glpsol it is available thru the options
--flip (for MIP) or --flip and --dual (for LP). This feature is
not documented yet.

Additional check was added to reject wrong solutions sometimes
reported by the PROXY heuristic.

A bug (memory leak) was fixed in the FPUMP heuristic routine.

The header sql.h was renamed to avoid conflicts with standard
ODBC headers.
   2015-11-27 22:00:29 by Adam Ciarcinski | Files touched by this commit (3)
Log message:
Changes 4.57:

A new, more efficient implementation of the dual simplex method
was included in the package. This new implementation replaces
the old one, which was removed.

Option sr_heur was added to struct glp_iocp to enable/disable
the simple rounding heuristic used by the MIP solver.

New API routine glp_at_error was added and documented.

Some minor typos were corrected in the GLPK documentation.

An example application program TSPSOL was added. It uses the
GLPK MIP optimizer to solve the Symmetric Traveling Salesman
Problem and illustrates "lazy" constraints generation. For more
details please see glpk/examples/tsp/README.
   2015-11-04 00:33:46 by Alistair G. Crooks | Files touched by this commit (262)
Log message:
Add SHA512 digests for distfiles for math category

Problems found locating distfiles:
	Package dfftpack: missing distfile dfftpack-20001209.tar.gz
	Package eispack: missing distfile eispack-20001130.tar.gz
	Package fftpack: missing distfile fftpack-20001130.tar.gz
	Package linpack: missing distfile linpack-20010510.tar.gz
	Package minpack: missing distfile minpack-20001130.tar.gz
	Package odepack: missing distfile odepack-20001130.tar.gz
	Package py-networkx: missing distfile networkx-1.10.tar.gz
	Package py-sympy: missing distfile sympy-
	Package quadpack: missing distfile quadpack-20001130.tar.gz

Otherwise, existing SHA1 digests verified and found to be the same on
the machine holding the existing distfiles (morden).  All existing
SHA1 digests retained for now as an audit trail.
   2014-08-30 13:19:52 by Adam Ciarcinski | Files touched by this commit (3)
Log message:
Changes 4.55:
Some internal (non-API) routines to estimate the condition of
the basis matrix were added. These routines are mainly intended
to be used by the simplex-based solvers.

Two open modes "a" and "ab" were added to GLPK I/O routines.

Minor bug was fixed in the solver glpsol (command-line options
--btf, --cbg, and --cgr didn't work properly).

A serious bug was fixed in a basis factorization routine used
on the dense phase. (The bug might appear only if the number of
rows exceeded sqrt(2**31) ~= 46,340 and caused access violation
exception because of integer overflow.)

Two API routines glp_alloc and glp_realloc were documented.

Translation of the document "Modeling Language GNU MathProg"
to Spanish was included (in LaTeX and pdf formats).
   2014-04-01 10:38:36 by Adam Ciarcinski | Files touched by this commit (5) | Package updated
Log message:
Changes 4.54:

Block-triangular LU-factorization was implemented to be used
on computing an initial factorization of the basis matrix.

A new version of the Schur-complement-based factorization
module was included in the package. Now it can be used along
with plain as well as with block-triangular LU-factorization.

Currently the following flags can be used to specify the type
of the basis matrix factorization (glp_bfcp.type):

GLP_BF_LUF + GLP_BF_FT   LUF, Forrest-Tomlin update (default)
GLP_BF_LUF + GLP_BF_BG   LUF, Schur complement, Bartels-Golub
GLP_BF_LUF + GLP_BF_GR   LUF, Schur complement, Givens rotation
GLP_BF_BTF + GLP_BF_BG   BTF, Schur complement, Bartels-Golub
GLP_BF_BTF + GLP_BF_GR   BTF, Schur complement, Givens rotation

In case of GLP_BF_FT the update is applied to matrix U, while
in cases of GLP_BF_BG and GLP_BF_GR the update is applied to
the Schur complement.

Corresponding new options --luf and --btf were added to glpsol.

For more details please see a new edition of the GLPK reference
manual included in the distribution.

A minor bug (in reporting the mip solution status) was fixed.

A call to "iodbc-config --cflags" was added in configure.ac
to correctly detect iodbc flags.
   2014-02-14 10:25:49 by Adam Ciarcinski | Files touched by this commit (3)
Log message:
Changes 4.53:
* The API routine glp_read_mps was changed to remove free rows.
* A bug was fixed in the API routine glp_read_lp.
* The zlib compression library used by some GLPK routines and
  included in the package was downgraded from 1.2.7 to 1.2.5 (as
  in GLPK 4.50) because of addressability bugs on some 64-bit
* A bug was fixed in a routine that reads gzipped files.
* Two API routines glp_get_it_cnt and glp_set_it_cnt were added.
* All obsolete GLPK API routines (prefixed with lpx) were removed
  from the package.
* A set of routines that simulate the old GLPK API (as defined
  in 4.48) were added; see examples/oldapi/api/lpx.c.
* A namespace bug was fixed in the SQL table drive module.