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.Simplex

Description

Naïve implementation of Simplex method

Reference:

Documentation

module Data.OptDir

type Tableau r = VarMap (Row r)Source

type RowIndex = IntSource

type ColIndex = IntSource

type Row r = (VarMap r, r)Source

data PivotResult r Source

Instances

Eq r => Eq (PivotResult r) 
Ord r => Ord (PivotResult r) 
Show r => Show (PivotResult r) 

objRow :: RowIndexSource

pivot :: (Fractional r, Eq r) => RowIndex -> ColIndex -> Tableau r -> Tableau rSource

lookupRow :: RowIndex -> Tableau r -> Row rSource

setRow :: (Num r, Eq r) => RowIndex -> Tableau r -> Row r -> Tableau rSource

setObjFun :: (Num r, Eq r) => Tableau r -> Expr r -> Tableau rSource

currentObjValue :: (Num r, Eq r) => Tableau r -> rSource

simplex :: (Real r, Fractional r) => OptDir -> Tableau r -> (Bool, Tableau r)Source

dualSimplex :: (Real r, Fractional r) => OptDir -> Tableau r -> (Bool, Tableau r)Source

phaseI :: (Real r, Fractional r) => Tableau r -> VarSet -> (Bool, Tableau r)Source

toCSV :: (Num r, Eq r, Show r) => (r -> String) -> Tableau r -> StringSource