toysolver-0.0.5: Assorted decision procedures for SAT, Max-SAT, PB, MIP, etc

Portabilitynon-portable (ScopedTypeVariables)
Stabilityprovisional
Maintainermasahiro.sakai@gmail.com
Safe HaskellNone

Algorithm.LPSolver

Description

Naïve implementation of Simplex method

Reference:

Documentation

type Solver r = (Var, Tableau r, VarSet, VarMap (Expr r))Source

type LP r = State (Solver r)Source

emptySolver :: VarSet -> Solver rSource

gensym :: LP r VarSource

getTableau :: LP r (Tableau r)Source

putTableau :: Tableau r -> LP r ()Source

addArtificialVariable :: Var -> LP r ()Source

getArtificialVariables :: LP r VarSetSource

clearArtificialVariables :: LP r ()Source

define :: Var -> Expr r -> LP r ()Source

getDefs :: LP r (VarMap (Expr r))Source

addConstraint :: Real r => Atom r -> LP r ()Source

addConstraint2 :: Real r => Atom r -> LP r ()Source

expandDefs :: (Num r, Eq r) => Expr r -> LP r (Expr r)Source

expandDefs' :: (Num r, Eq r) => Atom r -> LP r (Atom r)Source

tableau :: RealFrac r => [Atom r] -> LP r ()Source

getModel :: Fractional r => VarSet -> LP r (Model r)Source

phaseI :: (Fractional r, Real r) => LP r BoolSource

simplex :: (Fractional r, Real r) => OptDir -> Expr r -> LP r BoolSource

dualSimplex :: (Fractional r, Real r) => OptDir -> Expr r -> LP r BoolSource

normalizeConstraint :: forall r. Real r => Atom r -> (Expr r, RelOp, r)Source

collectNonnegVars :: forall r. RealFrac r => [Atom r] -> VarSet -> (VarSet, [Atom r])Source