Safe Haskell | None |
---|---|
Language | Haskell98 |
- optimize :: [RationalForm Rational] -> [Constraint Rational] -> OptimizeResult
- data LinearForm t = LinearForm t t t
- data RationalForm t = RationalForm (LinearForm t) (LinearForm t)
- data IneqType
- data Constraint t = Constraint (LinearForm t) IneqType
- type InitPair = InitPair' Rational
- data Path
- simulateOptimize :: Rational -> OptimizeResult
- simulateOptimize' :: RationalInf -> OptimizeResult
- data RatioInf t
- type RationalInf = RatioInf Integer
- data OptimizeResult
- optimalValue :: OptimizeResult -> RationalInf
- optimalPair :: OptimizeResult -> InitPair
- optimalPath :: OptimizeResult -> Path
Documentation
optimize :: [RationalForm Rational] -> [Constraint Rational] -> OptimizeResult Source
data LinearForm t Source
LinearForm t t t |
Eq t => Eq (LinearForm t) | |
Num t => Num (LinearForm t) | |
(Num t, Eq t, Show t) => Show (LinearForm t) | |
Num t => Monoid (LinearForm t) |
data RationalForm t Source
RationalForm (LinearForm t) (LinearForm t) |
Num t => Fractional (RationalForm t) | |
Num t => Num (RationalForm t) | |
(Eq t, Num t, Show t) => Show (RationalForm t) |
data Constraint t Source
(Eq t, Num t, Show t) => Show (Constraint t) |
Extends a rational type with positive and negative infinities.
type RationalInf = RatioInf Integer Source
Arbitrary-precision rational numbers with positive and negative infinities
optimalPath :: OptimizeResult -> Path Source