dsp-0.1: Haskell Digital Signal ProcessingContentsIndex
Matrix.Simplex
Portabilityportable
Stabilityexperimental
Maintainerm.p.donadio@ieee.org
Description

Two-step simplex algorithm

I only guarantee that this module wastes inodes

Synopsis
data Simplex a
= Unbounded
| Infeasible
| Optimal a
simplex :: Array (Int, Int) Double -> Simplex (Array (Int, Int) Double)
twophase :: Array (Int, Int) Double -> Simplex (Array (Int, Int) Double)
Documentation
data Simplex a
Type for results of the simplex algorithm
Constructors
Unbounded
Infeasible
Optimal a
show/hide Instances
Read a => Read (Simplex a)
Show a => Show (Simplex a)
simplex
:: Array (Int, Int) Doublestating 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
:: Array (Int, Int) Doublestating tableau
-> Simplex (Array (Int, Int) Double)solution
The two-phase simplex algorithm
Produced by Haddock version 0.8