Matrix.Simplex

Two-step simplex algorithm

I only guarantee that this module wastes inodes

Documentation

data Simplex a

Type for results of the simplex algorithm

Constructors

Unbounded

Infeasible

Optimal a

Instances

Read a => Read (Simplex a)

Defined in Matrix.Simplex

Methods

readsPrec :: Int -> ReadS (Simplex a)

readList :: ReadS [Simplex a]

readPrec :: ReadPrec (Simplex a)

readListPrec :: ReadPrec [Simplex a]

Show a => Show (Simplex a)

Defined in Matrix.Simplex

Methods

showsPrec :: Int -> Simplex a -> ShowS

show :: Simplex a -> String

showList :: [Simplex a] -> ShowS

simplex

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

Arguments

:: Array (Int, Int) Double

stating tableau

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

solution

The two-phase simplex algorithm