Math.ExpPairs.LinearForm

Provides types for rational forms (to hold objective functions in Math.ExpPairs) and linear contraints (to hold constraints of optimization). Both of them are built atop of projective linear forms.

Documentation

data LinearForm t

Define an affine linear form of two variables: a*k + b*l + c*m. First argument of LinearForm stands for a, second for b and third for c. Linear forms form a monoid by addition.

Constructors

LinearForm !t !t !t

Instances

Functor LinearForm

Foldable LinearForm

Eq t => Eq (LinearForm t)

Num t => Num (LinearForm t)

Show t => Show (LinearForm t)

Generic (LinearForm t)

Num t => Monoid (LinearForm t)

NFData t => NFData (LinearForm t)

(Num t, Eq t, Pretty t) => Pretty (LinearForm t)

type Rep (LinearForm t)

evalLF :: Num t => (t, t, t) -> LinearForm t -> t

Evaluate a linear form a*k + b*l + c*m for given k, l and m.

substituteLF :: (Eq t, Num t) => (LinearForm t, LinearForm t, LinearForm t) -> LinearForm t -> LinearForm t

Substitute linear forms k, l and m into a given linear form a*k + b*l + c*m to obtain a new linear form.

data RationalForm t

Define a rational form of two variables, equal to the ratio of two LinearForm.

Constructors

RationalForm (LinearForm t) (LinearForm t)

Instances

Functor RationalForm

Foldable RationalForm

Eq t => Eq (RationalForm t)

Num t => Fractional (RationalForm t)

Num t => Num (RationalForm t)

Show t => Show (RationalForm t)

Generic (RationalForm t)

NFData t => NFData (RationalForm t)

(Num t, Eq t, Pretty t) => Pretty (RationalForm t)

type Rep (RationalForm t)

evalRF :: (Real t, Num t) => (Integer, Integer, Integer) -> RationalForm t -> RationalInf

Evaluate a rational form (a*k + b*l + c*m) / (a'*k + b'*l + c'*m) for given k, l and m.

data IneqType

Constants to specify the strictness of Constraint.

Constructors

Strict

Strict inequality (>0).

NonStrict

Non-strict inequality (≥0).

Instances

Bounded IneqType

Enum IneqType

Eq IneqType

Ord IneqType

Show IneqType

Generic IneqType

Pretty IneqType

type Rep IneqType

data Constraint t

A linear constraint of two variables.

Constructors

Constraint !(LinearForm t) !IneqType

Instances

Functor Constraint

Foldable Constraint

Eq t => Eq (Constraint t)

Show t => Show (Constraint t)

Generic (Constraint t)

NFData t => NFData (Constraint t)

(Num t, Eq t, Pretty t) => Pretty (Constraint t)

type Rep (Constraint t)

checkConstraint :: (Num t, Ord t) => (Integer, Integer, Integer) -> Constraint t -> Bool

Evaluate a rational form of constraint and compare its value with 0. Strictness depends on the given IneqType.