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

Copyright(c) Masahiro Sakai 2012
LicenseBSD-style
Maintainermasahiro.sakai@gmail.com
Stabilityprovisional
Portabilitynon-portable (TypeSynonymInstances, FlexibleInstances, TypeFamilies, CPP)
Safe HaskellNone
LanguageHaskell2010

ToySolver.Simplex2

Contents

Description

Naïve implementation of Simplex method

Reference:

Synopsis

The Solver type

Problem specification

type Var = Int Source

data RelOp Source

relational operators

Constructors

Lt 
Le 
Ge 
Gt 
Eql 
NEq 

Instances

(.<=.) :: IsRel e r => e -> e -> r infix 4 Source

constructing relational formula

(.>=.) :: IsRel e r => e -> e -> r infix 4 Source

constructing relational formula

(.==.) :: IsRel e r => e -> e -> r infix 4 Source

constructing relational formula

(.<.) :: IsRel e r => e -> e -> r infix 4 Source

constructing relational formula

(.>.) :: IsRel e r => e -> e -> r infix 4 Source

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