comfort-glpk

Linear Programming using GLPK and comfort-array

Version on this page:	0.1
LTS Haskell 24.18:	0.1@rev:3
Stackage Nightly 2025-11-04:	0.1@rev:3
Latest on Hackage:	0.1@rev:3

See all snapshots comfort-glpk appears in

BSD-3-Clause licensed and maintained by Henning Thielemann

This version can be pinned in stack with:comfort-glpk-0.1@sha256:26e4452e21d364df04124061ab1bc53e5f7c122e9093ae98237d3d31b72d2f8c,2815

Module documentation for 0.1

Numeric
- Numeric.GLPK
  - Numeric.GLPK.Monad

Depends on 8 packages(full list with versions):

base, comfort-array, deepseq, glpk-headers, linear-programming, non-empty, transformers, utility-ht

Simple interface to linear programming functions provided by GLPK using the flexible Array shape framework from comfort-array.

E.g. you can use Shape.Tuple to convert safely between nested tuples and arrays with the same number of elements.

type X = Shape.Element
type PairShape = Shape.NestedTuple Shape.TupleIndex (X,X)

case Shape.indexTupleFromShape (Shape.static :: PairShape) of
  (posIx,negIx) ->
    case mapSnd (mapSnd Array.toTuple) <$>
         LP.simplex [] [[1.*posIx, (-1).*negIx] ==. 314]
           (LP.Minimize,
            Array.fromTuple (23,42) :: Array PairShape Double)
      of
        (Right (LP.Optimal, (absol, (pos, neg)))) ->
          printf "absol %f,  pos %f, neg %f\n" absol pos neg
        _ -> fail "GLPK solver failed"

Alternatives: coinor-clp, hmatrix-glpk, glpk-hs