Numeric.LinearProgramming.Monad

Generic implementation of a monad that collects constraints over multiple stages. It can be used to test solvers that allow for warm start or for solvers that do not allow for warm start at all (like GLPK's interior point solver).

Documentation

data T sh a

Instances

Applicative (T sh)

Defined in Numeric.LinearProgramming.Monad

Methods

pure :: a -> T sh a

(<*>) :: T sh (a -> b) -> T sh a -> T sh b

liftA2 :: (a -> b -> c) -> T sh a -> T sh b -> T sh c

(*>) :: T sh a -> T sh b -> T sh b

(<*) :: T sh a -> T sh b -> T sh a

Functor (T sh)

Defined in Numeric.LinearProgramming.Monad

Methods

fmap :: (a -> b) -> T sh a -> T sh b

(<$) :: a -> T sh b -> T sh a

Monad (T sh)

Defined in Numeric.LinearProgramming.Monad

Methods

(>>=) :: T sh a -> (a -> T sh b) -> T sh b

(>>) :: T sh a -> T sh b -> T sh b

return :: a -> T sh a

run :: (Indexed sh, Index sh ~ ix) => sh -> Bounds ix -> T sh a -> a

lift :: (Eq sh, Indexed sh, Index sh ~ ix) => (Bounds ix -> Constraints Double ix -> (Direction, Objective sh) -> a) -> Constraints Double ix -> (Direction, Objective sh) -> T sh a