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

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

Branch: pkgsrc-2009Q1, Version: 4.35, Package name: glpk-4.35, 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
language.


Required to run:
[devel/gmp]

Required to build:
[devel/gmake] [devel/libtool-base]

Master sites:

SHA1: d125e5b9ea593f80d1555032ca2e2148c64ae9d3
RMD160: 1e4594b9ad0da0fcbfa7842a5e4557af4a7d0fae
Filesize: 2123.529 KB

Version history: (Expand)