Safe Haskell	Safe-Inferred
Language	Haskell2010

Math.Programming.LinExpr

Description

Linear expressions of variables.

Synopsis

data LinExpr a b = LinExpr ![(a, b)] !a
(*.) :: Num a => a -> b -> LinExpr a b
(.*) :: Num a => b -> a -> LinExpr a b
(./) :: Fractional a => b -> a -> LinExpr a b
scale :: Num a => a -> LinExpr a b -> LinExpr a b
(.+.) :: Num a => LinExpr a b -> LinExpr a b -> LinExpr a b
(.-.) :: Num a => LinExpr a b -> LinExpr a b -> LinExpr a b
var :: Num a => b -> LinExpr a b
con :: a -> LinExpr a b
vsum :: Num a => [b] -> LinExpr a b
esum :: Num a => Foldable t => t (LinExpr a b) -> LinExpr a b
eval :: Num a => LinExpr a a -> a
simplify :: (Num a, Ord b) => LinExpr a b -> LinExpr a b

Documentation

data LinExpr a b Source #

A linear expression.

Linear expressions contain symbolic variables of type b and numeric coefficients of type a. Often a will be Double, and b will be whatever variable type your linear program uses.

Constructors

LinExpr ![(a, b)] !a

Instances

Instances details

Foldable (LinExpr a) Source #
Instance details Defined in Math.Programming.LinExpr Methods fold :: Monoid m => LinExpr a m -> m # foldMap :: Monoid m => (a0 -> m) -> LinExpr a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> LinExpr a a0 -> m # foldr :: (a0 -> b -> b) -> b -> LinExpr a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> LinExpr a a0 -> b # foldl :: (b -> a0 -> b) -> b -> LinExpr a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> LinExpr a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> LinExpr a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> LinExpr a a0 -> a0 # toList :: LinExpr a a0 -> [a0] # null :: LinExpr a a0 -> Bool # length :: LinExpr a a0 -> Int # elem :: Eq a0 => a0 -> LinExpr a a0 -> Bool # maximum :: Ord a0 => LinExpr a a0 -> a0 # minimum :: Ord a0 => LinExpr a a0 -> a0 # sum :: Num a0 => LinExpr a a0 -> a0 # product :: Num a0 => LinExpr a a0 -> a0 #
Traversable (LinExpr a) Source #
Instance details Defined in Math.Programming.LinExpr Methods traverse :: Applicative f => (a0 -> f b) -> LinExpr a a0 -> f (LinExpr a b) # sequenceA :: Applicative f => LinExpr a (f a0) -> f (LinExpr a a0) # mapM :: Monad m => (a0 -> m b) -> LinExpr a a0 -> m (LinExpr a b) # sequence :: Monad m => LinExpr a (m a0) -> m (LinExpr a a0) #
Functor (LinExpr a) Source #
Instance details Defined in Math.Programming.LinExpr Methods fmap :: (a0 -> b) -> LinExpr a a0 -> LinExpr a b # (<$) :: a0 -> LinExpr a b -> LinExpr a a0 #
Num a => Monoid (LinExpr a b) Source #
Instance details Defined in Math.Programming.LinExpr Methods mempty :: LinExpr a b # mappend :: LinExpr a b -> LinExpr a b -> LinExpr a b # mconcat :: [LinExpr a b] -> LinExpr a b #
Num a => Semigroup (LinExpr a b) Source #
Instance details Defined in Math.Programming.LinExpr Methods (<>) :: LinExpr a b -> LinExpr a b -> LinExpr a b # sconcat :: NonEmpty (LinExpr a b) -> LinExpr a b # stimes :: Integral b0 => b0 -> LinExpr a b -> LinExpr a b #
(Read a, Read b) => Read (LinExpr a b) Source #
Instance details Defined in Math.Programming.LinExpr Methods readsPrec :: Int -> ReadS (LinExpr a b) # readList :: ReadS [LinExpr a b] # readPrec :: ReadPrec (LinExpr a b) # readListPrec :: ReadPrec [LinExpr a b] #
(Show a, Show b) => Show (LinExpr a b) Source #
Instance details Defined in Math.Programming.LinExpr Methods showsPrec :: Int -> LinExpr a b -> ShowS # show :: LinExpr a b -> String # showList :: [LinExpr a b] -> ShowS #
(Eq a, Eq b) => Eq (LinExpr a b) Source #
Instance details Defined in Math.Programming.LinExpr Methods (==) :: LinExpr a b -> LinExpr a b -> Bool # (/=) :: LinExpr a b -> LinExpr a b -> Bool #