linear-programming-0.0.1: Linear Programming basic definitions
Safe HaskellSafe-Inferred
LanguageHaskell98

Numeric.LinearProgramming.Common

Documentation

data Term a ix Source #

Constructors

Term a ix 

Instances

Instances details
(Show a, Show ix) => Show (Term a ix) Source # 
Instance details

Defined in Numeric.LinearProgramming.Common

Methods

showsPrec :: Int -> Term a ix -> ShowS #

show :: Term a ix -> String #

showList :: [Term a ix] -> ShowS #

(.*) :: a -> ix -> Term a ix infix 7 Source #

data Inequality x Source #

Constructors

Inequality x Bound 

Instances

Instances details
Functor Inequality Source # 
Instance details

Defined in Numeric.LinearProgramming.Common

Methods

fmap :: (a -> b) -> Inequality a -> Inequality b #

(<$) :: a -> Inequality b -> Inequality a #

Show x => Show (Inequality x) Source # 
Instance details

Defined in Numeric.LinearProgramming.Common

data Bound Source #

Instances

Instances details
Show Bound Source # 
Instance details

Defined in Numeric.LinearProgramming.Common

Methods

showsPrec :: Int -> Bound -> ShowS #

show :: Bound -> String #

showList :: [Bound] -> ShowS #

type Bounds ix = [Inequality ix] Source #

type Constraints a ix = [Inequality [Term a ix]] Source #

(<=.) :: x -> Double -> Inequality x infix 4 Source #

(>=.) :: x -> Double -> Inequality x infix 4 Source #

(==.) :: x -> Double -> Inequality x infix 4 Source #

(>=<.) :: x -> (Double, Double) -> Inequality x infix 4 Source #

objectiveFromTerms :: (Indexed sh, Index sh ~ ix) => sh -> [Term Double ix] -> Objective sh Source #