|
| Matrix.Simplex | | Portability | portable | | Stability | experimental | | Maintainer | m.p.donadio@ieee.org |
|
|
|
|
|
| Description |
Two-step simplex algorithm I only guarantee that this module wastes inodes
|
|
| Synopsis |
|
|
|
| Documentation |
|
| data Simplex a |
| Type for results of the simplex algorithm | | Constructors | | Unbounded | | | Infeasible | | | Optimal a | |
|
|
|
| simplex |
| :: 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 |
| :: Array (Int, Int) Double | stating tableau | | -> Simplex (Array (Int, Int) Double) | solution | | The two-phase simplex algorithm |
|
|
| Produced by Haddock version 0.4 |