dsp-0.2.5: Haskell Digital Signal Processing

Copyright(c) Matthew Donadio 2003
LicenseGPL
Maintainerm.p.donadio@ieee.org
Stabilityexperimental
Portabilityportable
Safe HaskellSafe
LanguageHaskell98

Matrix.Simplex

Description

Two-step simplex algorithm

I only guarantee that this module wastes inodes

Synopsis

Documentation

data Simplex a Source #

Type for results of the simplex algorithm

Constructors

Unbounded 
Infeasible 
Optimal a 
Instances
Read a => Read (Simplex a) Source # 
Instance details

Defined in Matrix.Simplex

Show a => Show (Simplex a) Source # 
Instance details

Defined in Matrix.Simplex

Methods

showsPrec :: Int -> Simplex a -> ShowS #

show :: Simplex a -> String #

showList :: [Simplex a] -> ShowS #

simplex Source #

Arguments

:: Array (Int, Int) Double

stating tableau

-> Simplex (Array (Int, Int) Double)

solution

The simplex algorithm for standard form:

min c'x

where Ax = b, x >= 0

a!(0,0) = -z

a!(0,j) = c'

a!(i,0) = b

a!(i,j) = A_ij

twophase Source #

Arguments

:: Array (Int, Int) Double

stating tableau

-> Simplex (Array (Int, Int) Double)

solution

The two-phase simplex algorithm