Algorithm::Simplex::PDL - PDL version of the Simplex Algorithm
Do the algebra of a Tucker/Bland pivot. i.e. Traverse from one node to and adjacent node along the Simplex of feasible solutions.
Set the number of rows. This is actually for the A matrix in Ax <= y. So the number is one less than the total number of rows in the tableau. The same holds for number of columns.
set the number of columns given the tableau matrix
