Path to this page:
./
math/glpk,
Library for solving linear programming problems
Branch: pkgsrc-2011Q2,
Version: 4.45,
Package name: glpk-4.45,
Maintainer: adamGLPK 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
language.
Required to run:[
devel/gmp]
Required to build:[
devel/libtool-base] [
devel/gmake]
Master sites: (Expand)
SHA1: 1bae1e4a55382b4fa4ce4afe7f15f7db22a2e886
RMD160: 5f6679574e8237c225b81e36446d0ff0caaa3e0e
Filesize: 3059.022 KB
Version history: (Expand)
- (2011-08-05) Package added to pkgsrc.se, version glpk-4.45 (created)