An exponential example for Terlaky's pivoting rule for the criss-cross simplex method |
| |
| Authors: | C. Roos |
| |
| Affiliation: | (1) Department of Mathematics and Informatics, Delft University of Technology, P.O. Box 356, 2600 AJ Delft, The Netherlands |
| |
| Abstract: | Recently T. Terlaky has proposed a new pivoting rule for the criss-cross simplex method for linear programming and he proved that his rule is convergent. In this note we show that the required number of iterations may be exponential in the number of variables and constraints of the problem. |
| |
| Keywords: | Linear programming pivoting rule Gray code |
| 本文献已被 SpringerLink 等数据库收录！ |
