glpk-hs: Comprehensive GLPK linear programming bindings
|Versions||0.0.0, 0.0.1, 0.0.2, 0.0.3, 0.0.4, 0.1.0, 0.2.0, 0.2.1, 0.2.2, 0.2.3, 0.2.4, 0.3.1, 0.3.2, 0.3.3, 0.3.4, 0.3.5, 0.5|
|Dependencies||array, base (==4.*), containers, mtl [details]|
|Maintainer||Louis Wasserman <firstname.lastname@example.org>|
|Uploaded||by LouisWasserman at Tue Mar 9 23:58:03 UTC 2010|
|Downloads||6285 total (50 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI
Friendly interface to GLPK's linear programming and mixed integer programming features. Intended for easy extensibility,
with a general, pure-Haskell representation of linear programs. Also includes usefully general algebraic structures.
To design a linear programming problem,
use Data.LinearProgram.LPMonad to construct the constraints and specifications. Linear functions are essentially specified
Data.Maps from variables to their coefficients, and functions for manipulating them are available in Data.LinFunc.
Then Data.LinearProgram.GLPK provides facilities for using the GLPK solver system on your problem, with a sizable number
of options available.
For package maintainers and hackage trustees