Numeric.COINOR.CLP.Monad

The monadic interface to CLP allows to optimize with respect to multiple objectives, successively.

Documentation

data T sh a

Instances

Applicative (T sh)

Defined in Numeric.COINOR.CLP.Monad

Methods

pure :: a -> T sh a

(<*>) :: T sh (a -> b) -> T sh a -> T sh b

liftA2 :: (a -> b -> c) -> T sh a -> T sh b -> T sh c

(*>) :: T sh a -> T sh b -> T sh b

(<*) :: T sh a -> T sh b -> T sh a

Functor (T sh)

Defined in Numeric.COINOR.CLP.Monad

Methods

fmap :: (a -> b) -> T sh a -> T sh b

(<$) :: a -> T sh b -> T sh a

Monad (T sh)

Defined in Numeric.COINOR.CLP.Monad

Methods

(>>=) :: T sh a -> (a -> T sh b) -> T sh b

(>>) :: T sh a -> T sh b -> T sh b

return :: a -> T sh a

run :: (Indexed sh, Index sh ~ ix) => sh -> Bounds ix -> T sh a -> a

simplex :: (Eq sh, Indexed sh, Index sh ~ ix) => Method -> Constraints Double ix -> (Direction, Objective sh) -> T sh (Result sh)

Add new constraints to an existing problem and run with a new direction and objective.

>>> case Shape.indexTupleFromShape tripletShape of
      (x,y,z) ->
         mapSnd Array.toTuple <$>
         LP.run tripletShape []
            (LP.simplex LP.dual
               [[2.*x, 1.*y] <=. 10, [1.*y, (5::Double).*z] <=. 20]
               (LP.Maximize, Array.fromTuple (4,-3,2) :: Array.Array TripletShape Double))
Right (28.0,(5.0,0.0,4.0))

forAllMethod $ \method ->
   TestLP.forAllOrigin $ \origin ->
   TestLP.forAllProblem origin $ \bounds constrs ->
   QC.forAll (TestLP.genObjective origin) $ \(dir,obj) ->
   case (CLP.simplex method bounds constrs (dir,obj),
         LP.run (Array.shape origin) bounds $
            LP.simplex method constrs (dir,obj)) of
      (Right (optA,_), Right (optB,_)) ->
         TestLP.approxReal 0.1 optA optB; _ -> False

forAllMethod $ \method ->
   TestLP.forAllOrigin $ \origin ->
   TestLP.forAllProblem origin $ \bounds constrs ->
   TestLP.forAllObjectives origin $ \objs_ ->
   case TestLP.successiveObjectives origin 0.01 objs_ of
      (dirObj, objs) ->
         either (\msg -> QC.counterexample (show msg) False) (const $ QC.property True) $
         runSuccessive method (Array.shape origin) bounds (constrs,dirObj) objs

forAllMethod $ \method ->
   TestLP.forAllOrigin $ \origin ->
   TestLP.forAllProblem origin $ \bounds constrs ->
   TestLP.forAllObjectives origin $ \objs_ ->
   case TestLP.successiveObjectives origin 0.01 objs_ of
      (dirObj, objs) ->
         approxSuccession 0.01
            (solveSuccessiveWarm (LP.simplex method)
               (Array.shape origin) bounds (constrs,dirObj) objs)
            (solveSuccessiveGen method
               (Array.shape origin) bounds (constrs,dirObj) objs)

concurrent :: (Eq sh, Indexed sh, Index sh ~ ix) => T [] Method -> Constraints Double ix -> (Direction, Objective sh) -> T sh (Result sh)

forAllMethod $ \method ->
   TestLP.forAllOrigin $ \origin ->
   TestLP.forAllProblem origin $ \bounds constrs ->
   TestLP.forAllObjectives origin $ \objs_ ->
   case TestLP.successiveObjectives origin 0.01 objs_ of
      (dirObj, objs) ->
         approxSuccession 0.01
            (solveSuccessiveWarm (LP.simplex method)
               (Array.shape origin) bounds (constrs,dirObj) objs)
            (solveSuccessiveWarm
               (LP.concurrent (NonEmpty.singleton method))
               (Array.shape origin) bounds (constrs,dirObj) objs)

forAllMethod $ \method ->
   forAllMethod $ \methodA ->
   forAllMethod $ \methodB ->
   forAllMethod $ \methodC ->
   TestLP.forAllOrigin $ \origin ->
   TestLP.forAllProblem origin $ \bounds constrs ->
   TestLP.forAllObjectives origin $ \objs_ ->
   case TestLP.successiveObjectives origin 0.01 objs_ of
      (dirObj, objs) ->
         approxSuccession 0.01
            (solveSuccessiveWarm (LP.simplex method)
               (Array.shape origin) bounds (constrs,dirObj) objs)
            (solveSuccessiveWarm
               (LP.concurrent (methodA!:methodB:methodC:[]))
               (Array.shape origin) bounds (constrs,dirObj) objs)

data Direction

Constructors

Minimize

Maximize

Instances

Bounded Direction

Defined in Numeric.LinearProgramming.Common

Methods

minBound :: Direction

maxBound :: Direction

Enum Direction

Defined in Numeric.LinearProgramming.Common

Methods

succ :: Direction -> Direction

pred :: Direction -> Direction

toEnum :: Int -> Direction

fromEnum :: Direction -> Int

enumFrom :: Direction -> [Direction]

enumFromThen :: Direction -> Direction -> [Direction]

enumFromTo :: Direction -> Direction -> [Direction]

enumFromThenTo :: Direction -> Direction -> Direction -> [Direction]

Show Direction

Defined in Numeric.LinearProgramming.Common

Methods

showsPrec :: Int -> Direction -> ShowS

show :: Direction -> String

showList :: [Direction] -> ShowS

Eq Direction

Defined in Numeric.LinearProgramming.Common

Methods

(==) :: Direction -> Direction -> Bool

(/=) :: Direction -> Direction -> Bool

dual :: Method

primal :: Method