coinor-clp

Linear Programming using COIN-OR/CLP and comfort-array

Version on this page:0.0.0.1
LTS Haskell 24.18:0.0.0.2@rev:2
Stackage Nightly 2025-11-03:0.0.0.2@rev:2
Latest on Hackage:0.0.0.2@rev:2

See all snapshots coinor-clp appears in

BSD-3-Clause licensed and maintained by Henning Thielemann
This version can be pinned in stack with:coinor-clp-0.0.0.1@sha256:84ebe303d4793a4c01f58078ddb03bab5e7e91015d59cd45a36312660fa682c3,2976

Module documentation for 0.0.0.1

Simple interface to linear programming functions provided by COIN-OR 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 "COINOR solver failed"

Alternatives: comfort-glpk, hmatrix-glpk, glpk-hs