A term equivalent to a full sensitivity analysis of an optimal solution to a linear programming problem. Ranging refers to how much the cost coefficients and the right-hand-side elements of the linear program can vary before the optimal feasible basis is no longer optimal or feasible. A ranging analysis could also include variations of a technological coefficient, but it is not standard practice. A full cost and right-hand-side ranging analysis is part of computer-based simplex method solutions. Linear programming; Sensitivity analysis; Simplex method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Gass, S.I., Harris, C.M. (2001). Ranging . In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_855
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_855
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive