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

Copyright(c) Masahiro Sakai 2011
LicenseBSD-style
Maintainermasahiro.sakai@gmail.com
Stabilityprovisional
Portabilitynon-portable (ScopedTypeVariables)
Safe HaskellNone
LanguageHaskell2010

ToySolver.Arith.Simplex.Textbook.MIPSolver.Simple

Description

References:

Synopsis

Documentation

data OptResult r Source #

results of optimization

Constructors

OptUnsat 
Unbounded 
Optimum r (Model r) 
Instances
Eq r => Eq (OptResult r) Source # 
Instance details

Defined in ToySolver.Arith.Simplex.Textbook.LPSolver.Simple

Methods

(==) :: OptResult r -> OptResult r -> Bool #

(/=) :: OptResult r -> OptResult r -> Bool #

Ord r => Ord (OptResult r) Source # 
Instance details

Defined in ToySolver.Arith.Simplex.Textbook.LPSolver.Simple

Show r => Show (OptResult r) Source # 
Instance details

Defined in ToySolver.Arith.Simplex.Textbook.LPSolver.Simple

minimize :: RealFrac r => Expr r -> [Atom r] -> VarSet -> OptResult r Source #

maximize :: RealFrac r => Expr r -> [Atom r] -> VarSet -> OptResult r Source #

optimize :: RealFrac r => OptDir -> Expr r -> [Atom r] -> VarSet -> OptResult r Source #