| Class | Description |
|---|---|
| FerrisMangasarianWrightPhase1 |
The phase 1 procedure finds a feasible table from an infeasible one by pivoting the simplex table of a related problem.
|
| FerrisMangasarianWrightScheme2 |
The scheme 2 procedure removes equalities and free variables.
|
| JordanExchange |
Jordan Exchange swaps the r-th entering variable (row) with the s-th leaving variable (column) in a matrix A.
|
| SimplexTable |
This is a simplex table used to solve a linear programming problem using a simplex method.
|
| SimplexTable.Label |
| Enum | Description |
|---|---|
| SimplexTable.LabelType |