A Z-simplex algorithm with partial updates (Q1097835)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Z-simplex algorithm with partial updates |
scientific article |
Statements
A Z-simplex algorithm with partial updates (English)
0 references
1987
0 references
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).
0 references
partial updates
0 references
canonical bases
0 references
Z-simplex algorithm
0 references
Y-dual
0 references
0 references