Given an optimal basic feasible solution to a linear-programming problem, this rule allows for simultaneous changes in objective function coefficients or right-hand-side values of a linear-programming problem that maintains the optimality of the current basis. The name comes from the fact that the sum of the ratios of the proposed changes over their respective possible ranges must sum to one or less.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Sweeney, D. J., et al. (2009). Quantitative methods for business. Mason, OH: South Western Cengage Learning.
Wendell, R. (1992). Sensitivity analysis revisted and extended. Decision Sciences, 23(5), 1127–1142.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this entry
Cite this entry
(2013). Hundred Percent Rule. In: Gass, S.I., Fu, M.C. (eds) Encyclopedia of Operations Research and Management Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-1153-7_200296
Download citation
DOI: https://doi.org/10.1007/978-1-4419-1153-7_200296
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-1137-7
Online ISBN: 978-1-4419-1153-7
eBook Packages: Business and Economics