glpk-hs-0.5: Comprehensive GLPK linear programming bindings

Safe HaskellNone
LanguageHaskell98

Data.LinearProgram.LinExpr

Documentation

data LinExpr v c Source #

Constructors

LinExpr (LinFunc v c) c 

Instances

(Ord v, Ring c) => Module c (LinExpr v c) Source # 

Methods

(*^) :: c -> LinExpr v c -> LinExpr v c #

(Eq v, Eq c) => Eq (LinExpr v c) Source # 

Methods

(==) :: LinExpr v c -> LinExpr v c -> Bool #

(/=) :: LinExpr v c -> LinExpr v c -> Bool #

(Ord v, Read v, Read c) => Read (LinExpr v c) Source # 
(Show v, Show c) => Show (LinExpr v c) Source # 

Methods

showsPrec :: Int -> LinExpr v c -> ShowS #

show :: LinExpr v c -> String #

showList :: [LinExpr v c] -> ShowS #

(Ord v, Additive c) => Additive (LinExpr v c) Source # 

Methods

(+) :: LinExpr v c -> LinExpr v c -> LinExpr v c #

zero :: LinExpr v c #

times :: Natural -> LinExpr v c -> LinExpr v c #

(Ord v, AbelianAdditive c) => AbelianAdditive (LinExpr v c) Source # 
(Ord v, Group c) => Group (LinExpr v c) Source # 

Methods

(-) :: LinExpr v c -> LinExpr v c -> LinExpr v c #

negate :: LinExpr v c -> LinExpr v c #

mult :: Integer -> LinExpr v c -> LinExpr v c #

solve :: (Ord v, Eq c, VectorSpace c c) => [(LinFunc v c, c)] -> Maybe (Map v (LinExpr v c)) Source #

substituteExpr :: (Ord v, Module c c) => v -> LinExpr v c -> LinExpr v c -> LinExpr v c Source #

simplifyExpr :: (Ord v, Module c c) => LinExpr v c -> Map v (LinExpr v c) -> LinExpr v c Source #

funcToExpr :: Group c => LinFunc v c -> LinExpr v c Source #