Abstract
The scaling of linear programming problems remains a rather poorly understood subject (as indeed it does for linear equations). Although many scaling techniques have been proposed, the rationale behind them is not always evident and very few numerical results are available. This paper considers a number of these techniques and gives numerical results for several real problems. Particular attention is given to two “optimal” scaling methods, giving results on their speed and effectiveness (in terms of their optimality criteria) as well as well as their influence on the numerical behavior of the problem.
Research and reproduction of this report was partially supported by the U.S. Atomic Energy Commission Contract AT(04-3)-326 PA # 18; and National Science Foundation. Grant GJ 30408X1.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
F.L. Bauer, “Optimally scaled matrices”, Numerische Mathematik 5 (1963) 73–87.
E.M.L. Beale, Mathematical programming in practice (Pitman, London, 1968).
J. de Buchet, “Expériences et statistiques sur la résolution des programmes linéaires de grandes dimensions”, in: D.B. Hertz and J. Melese, eds., Proceedings 4th IFORS conference (Wiley, New York, 1966) pp. 3–12.
A.R. Curtis and J.K. Reid, “On the automatic scaling of matrices for Gaussian elimination”, Journal of the Institute of Mathematics and its Applications 10 (1972) 118–124.
J.C. Dickson, “On keeping both storage and I/O requirements low in linear programming”, paper presented to the VIII International Symposium on Mathematical Programming (1973) (abstract).
D.R. Fulkerson and P. Wolfe, “An algorithm for scaling matrices”, SIAM Review 4 (1962) 142–146.
R.W. Hamming, Introduction to applied numerical analysis (McGraw-Hill, New York, 1971).
P.M.J. Harris, “Pivot selection methods of the Devex LP code”, Mathematical Programming Study 4 (1974) 30–57 (this volume).
G. Hentges, “MPS/360-matrix scaling”, IBM France research memorandum (March 1969).
J.E. Kalan, “Aspects of large-scale in-core linear programming”, in: ACM 1971 annual conference proceedings.
W. Orchard-Hays, Advanced linear programming computing techniques (McGraw-Hill, New York, 1968).
J.K. Reid, “A note on the stability of Gaussian elimination”, Journal of the Institute of Mathematics and its Applications 8 (1971) 374–375.
L. Slate, Private communication (November 1972).
A. van der Sluis, “Condition numbers and equilibration of matrices”, Numerische Mathematik 14 (1969) 14–23.
A. van der Sluis, “Condition, equilibration and pivoting in linear algebraic systems”, Numerische Mathematik 15 (1970) 74–86.
J.A. Tomlin, “Pivoting for size and sparsity in linear programming inversion routines”, Journal of the Institute of Mathematics and its Applications 10 (1972) 289–295.
J.H. Wilkinson, The algebraic eigenvalue problem (Oxford University Press, Oxford, 1965).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 The Mathematical Programming Society
About this chapter
Cite this chapter
Tomlin, J.A. (1975). On scaling linear programming problems. In: Balinski, M.L., Hellerman, E. (eds) Computational Practice in Mathematical Programming. Mathematical Programming Studies, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120718
Download citation
DOI: https://doi.org/10.1007/BFb0120718
Received:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00765-1
Online ISBN: 978-3-642-00766-8
eBook Packages: Springer Book Archive