A Z-simplex algorithm with partial updates (Q1097835)

The simplex algorithm for solving \(\max \{c^ Tx:\) \(Ax=b\), \(x\geq 0\}\) can be presented in terms of canonical bases Z of N(A), which is the so- called Z-simplex algorithm. In this implementation the bases Z are updated from iteration to iteration. The author shows that only part of Z needs to be updated at each iteration. A similar result holds for the so- called Y-dual method which implements the simplex dual method in terms of canonical bases Y of R(A).