Abstract
This paper describes the results of over four years of research, development, implementation and use of a system which will optimally merge microdata files. The merge process requires solving transportation problems with up to 50 000 constraints and 60 million variables, and is now being performed on a production basis. The resultant statistical data files fuel U.S. tax policy evaluation models which are used today in the design and analysis of Federal legislation. Computational experience with this pioneering optimization software is described.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Analysis, Research and Computation, Inc., “Extended Transportation System (ETS) programmer technical reference manual”, P.O. Box 4067, Austin, TX (1975).
Richard S. Barr, “Primal simplex network codes: A computational study”, Research Report, Edwin L. Cox School of Business, Southern Methodist University, Dallas, TX (1980).
Richard S. Barr, Fred Glover and Darwin Klingman, “An improved version of the out-of-kilter method and a comparative study of computer codes”, Mathematical Programming 7 (1974) 60–86.
Richard S. Barr, Fred Glover and Darwin Klingman, “The alternating basis algorithm for assignment problems”, Mathematical Programming 13 (1977) 1–13.
Richard S. Barr, Fred Glover and Darwin Klingman, “Enhancements to spanning tree labelling procedures for network optimization”, INFOR 17 (1) (1979) 16–33.
Richard S. Barr, Joyce Elam, Fred Glover and Darwin Klingman, “A network augmenting path basis algorithm for transshipment problems”, in: A.V. Fiacco and K.O. Kortanek, eds., External methods and systems analysis (Springer, Berlin, 1980).
Richard S. Barr and J. Scott Turner, “New techniques for statistical merging of microdata files”, in: R. Haveman and K. Hollenbeck, eds., Microeconomic simulation models for public policy analysis, (Academic Press, New York, 1980).
Richard S. Barr and J. Scott Turner, “A new, linear programming approach to microdata file merging”, in: U.S. Department of the Treasury, 1978 Compendium of tax research (U.S. Government Printing Office, Washington, D.C., 1978) pp. 129–155.
Gordon H. Bradley, Gerald G. Brown and Glenn W. Graves, “Design and implementation of large scale primal transshipment algorithms”, Management Science 24 (1) (1977) 1–34.
Edward C. Budd, “The creation of a microdata file for estimating the size distribution of income”, Review of Income and Wealth 17 (4) (1971) 317–334.
A. Charnes and W.W. Cooper, Management models and industrial applications of linear programming, (Wiley, New York, 1961).
Fred Glover, John Hultz and Darwin Klingman, “Improved computer-based planning techniques, Part 1”, Interfaces 8 (4) (1978) 16–25.
Fred Glover, David Karney and Darwin Klingman, “Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems”, Networks 4 (3) (1974) 192–211.
Fred Glover, David Karney, Darwin Klingman and A. Napier, “A computational study on start procedures, basis change criteria, and solution algorithms for transportation problems”, Management Science 20 (5) (1974) 793–813.
Fred Glover, Darwin Klingman and Joel Stutz, “Augmented threaded index method for network optimization”, INFOR 12 (3) (1974) 293–298.
Joseph Kadane, “Some statistical properties in merging data files”, in: U.S. Department of the Treasury, 1978 Compendium of tax research (U.S. Government Printing Office, Washington, D.C., 1978).
James A. Kalan, private communication.
David Karney and Darwin Klingman, “Implementation and computational study on an incore/out-of-core primal network code”, Operations Research 24 (6) (1976) 1056–1077.
D. Klingman, A. Napier and J. Stutz, “NETGEN’ A program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems”, Management Science 20 (5) (1974) 814–821.
John M. Mulvey, “Pivot strategies for primal-simplex network codes”, Journal of the Association for Computing Machines 25 (2) (1978) 266–270.
Benjamin Okner, “Constructing a new data base from existing microdata sets: The 1966 merge file”, Annals of Economic and Social Measurement 1 (1972) 325–342.
Daniel B. Radner, “The development of statistical matching in economics”, 1978 Proceedings of the American Statistical Association Social Statistics Section (1978).
J. Scott Turner and Gary B. Gilliam, “Reducing and merging microdata files”, OTA Paper 7, Office of Tax Analysis, U.S. Department of the Treasury, Washington, D.C. (1975).
J. Scott Turner and Gary A. Robbins, “Microdata set merging using microdata files”, Research Report, Office of Tax Analysis, U.S. Department of the Treasury, Washington, D.C. (1974).
V. Srinivasan and G.L. Thompson, “Benefit-cost analysis of coding techniques for the primal transportation algorithm”, Journal of the Association for Computing Machinery 20 (1973) 194–213.
U.S. Department of the Treasury, Blueprints for basic tax reform. (U.S. Government Printing Office, Washington, D.C., 1978).
U.S. Department of the Treasury, The President’s 1978 tax program (U.S. Government Printing Office, Washington, D.C., 1978).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 The Mathematical Programming Society
About this chapter
Cite this chapter
Barr, R.S., Scott Turner, J. (1981). Microdata file merging through large-scale network technology. In: Klingman, D., Mulvey, J.M. (eds) Network Models and Associated Applications. Mathematical Programming Studies, vol 15. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120935
Download citation
DOI: https://doi.org/10.1007/BFb0120935
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00807-8
Online ISBN: 978-3-642-00808-5
eBook Packages: Springer Book Archive