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

Portabilitynon-portable (TypeSynonymInstances, FlexibleInstances, TypeFamilies, CPP)
Stabilityprovisional
Maintainermasahiro.sakai@gmail.com
Safe HaskellNone

Algorithm.Simplex2

Contents

Description

Naïve implementation of Simplex method

Reference:

Synopsis

The Solver type

Problem specification

type Var = IntSource

data RelOp Source

relational operators

Constructors

Lt 
Le 
Ge 
Gt 
Eql 
NEq 

Instances

(.<=.) :: IsRel e r => e -> e -> rSource

constructing relational formula

(.>=.) :: IsRel e r => e -> e -> rSource

constructing relational formula

(.==.) :: IsRel e r => e -> e -> rSource

constructing relational formula

(.<.) :: IsRel e r => e -> e -> rSource

constructing relational formula

(.>.) :: IsRel e r => e -> e -> rSource

constructing relational formula

type Atom r = Rel (Expr r)Source

Atomic Formula of Linear Arithmetics

data OptDir

The OptDir type represents optimization directions.

Constructors

OptMin

minimization

OptMax

maximization

Solving

data Options Source

Constructors

Options 

data OptResult Source

results of optimization

Constructors

Optimum 
Unsat 
Unbounded 
ObjLimit 

Extract results

Reading status

Configulation

setLogger :: GenericSolver v -> (String -> IO ()) -> IO ()Source

set callback function for receiving messages.

Debug