Encyclopedia of Operations Research and Management Science

2013 Edition
| Editors: Saul I. Gass, Michael C. Fu


Reference work entry
DOI: https://doi.org/10.1007/978-1-4419-1153-7_200349

The cycle of steps of an algorithm is called an iteration. For example, in the simplex algorithm for solving linear-programming problems, one iteration is given concisely by the steps: (1) select a nonbasic variable to replace a basic variable, (2) determine the inverse of the new feasible basis, and (3) determine if the new basic feasible solution is optimal.

Copyright information

© Springer Science+Business Media New York 2013