Matrix.Simplex

Description

Two-step simplex algorithm

I only guarantee that this module wastes inodes

Synopsis

Documentation

Type for results of the simplex algorithm

Constructors

Instances details

Read a => Read (Simplex a) Source #
Instance details 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) Source #
Instance details Defined in Matrix.Simplex Methods showsPrec :: Int -> Simplex a -> ShowS # show :: Simplex a -> String # showList :: [Simplex a] -> ShowS #

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

Arguments

:: Array (Int, Int) Double	stating tableau
-> Simplex (Array (Int, Int) Double)	solution

The two-phase simplex algorithm