The pre-solution transformation of the data of a problem that attempts to make the magnitudes of all the data as close as possible. Such scaling is important for mathematical-and linear-programming problems as it helps to reduce roundoff error. Most mathematical-programming systems have a SCALE command that automatically adjusts the magnitudes of the data in the rows and columns. This can be done by multiplying the technological coefficient matrix Av by suitable row and column transformation matrices. A frequently used scaling algorithm is to divide each row by the largest absolute element in it, and then divide each resulting column by the largest absolute element in it. This ensures that the largest absolute value in the matrix is 1.0 and that each column and row has at least one element equal to 1.0.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor 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). Scaling . 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_920
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_920
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