Encyclopedia of Operations Research and Management Science

2001 Edition
| Editors: Saul I. Gass, Carl M. Harris


Reference work entry
DOI: https://doi.org/10.1007/1-4020-0611-X_486

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) deter-mine if the new basic feasible solution is optimal.

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  1. 1.Robert H. Smith School of BusinessUniversity of MarylandCollege PartUSA
  2. 2.School of Information Technology & EngineeringGeorge Mason UniversityFairfaxUSA