Encyclopedia of Operations Research and Management Science

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

Perturbation Methods

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

Procedures that modify the constraints of a linear-programming problem so that all basic feasible solutions will be nondegenerate, thus removing the possibility of cycling in the simplex method. The modification can be either explicitly done by adding small quantities to the right-hand sides or implicitly by using lexicographic procedures.

See

Copyright information

© Springer Science+Business Media New York 2013