SAS® Macros for Constraining Arrays of Numbers

Coleman, Charles (2015): SAS® Macros for Constraining Arrays of Numbers. Published in: Southeast SAS Users Group 2015 Proceedings

Abstract

Many applications require constraining arrays of numbers to controls in one or two dimensions. Example applications include survey estimates, disclosure avoidance, input-output tables, and population and other estimates and projections. If the results are allowed to take on any nonnegative values, raking (a.k.a. scaling) solves the problem in one dimension and two-way iterative raking solves it in two dimensions. Each of these raking macros has an option for the user to output a dataset containing the rakes. The problem is more complicated in one dimension if the data can be of any sign, the so-called “plus-minus” problem, as simple raking may produce unacceptable results. This problem is addressed by generalized raking, which preserves the structure of the data at the cost of a nonunique solution. Often, results are required to be rounded so as to preserve the original totals. The Cox-Ernst algorithm accomplishes an optimal controlled rounding in two dimensions. In one dimension, the Greatest Mantissa algorithm is a simplified version of the Cox-Ernst algorithm.

Each macro contains error control code. The macro variable &errorcode is made available to the programmer to enable error trapping.

• Item Type: MPRA Paper
• Language: English
• Keywords: RAS. Range-RAS, RRAS, IPF, iterative proportionate fitting, raking, controlled rounding, Cox-Ernst algorithm
• Subjects: C - Mathematical and Quantitative Methods > C0 - General > C02 - Mathematical Methods; C - Mathematical and Quantitative Methods > C6 - Mathematical Methods ; Programming Models ; Mathematical and Simulation Modeling > C67 - Input-Output Models; D - Microeconomics > D5 - General Equilibrium and Disequilibrium > D57 - Input-Output Tables and Analysis; J - Labor and Demographic Economics > J1 - Demographic Economics > J10 - General; R - Urban, Rural, Regional, Real Estate, and Transportation Economics > R1 - General Regional Economics > R15 - Econometric and Input-Output Models ; Other Models

References

Akers, D.S. and J.S. Siegel. 1965. “National Census Survival Rates, by Color and Sex, for 1950–1960.” Current Population Reports, series P-23, no. 15. Washington, DC: U.S. Bureau of the Census.

Bacharach, M. 1970. Biproportional Matrices and Input-output Change. Cambridge: Cambridge University Press.

Bregman, L.M. 1967. “Proof of the Convergence of Sheleikhovskii’s Method for a Problem with Transportation Constraints.” USSR Computational Mathematics and Mathematical Physics 1(1), 191–204 . Causey, B.D., L. H. Cox and L. R. Ernst. 1985. “Applications of Transportation Theory to Statistical Problems.” Journal of the American Statistical Association. 80(392), 903–909.

Censor, Y. and S. A. Zenios. 1991. “Interval-Constrained Matrix Balancing.” Linear Algebra and Its Applications. 150, 393-421.

Coleman, C. D. 2006a. “Generalized Raking.” Manuscript, Washington, DC: U.S. Census Bureau.

Coleman, C. D. 2006b. “The Greatest Mantissa Algorithm.” Manuscript, Washington, DC: U.S. Census Bureau.

Cox, L. H. 2003. “On Properties of Multi-Dimensional Statistical Tables.” Journal of Statistical Planning and Inference. 117(2), 251–273.

Cox, L. H. and Lawrence R. Ernst, 1982, “Controlled Rounding,” INFOR. 20, 423–452.

Fagan, J. and B. Greenberg, “Making Tables Additive in the Presence of Zeros,” Statistical Research Division Report No. CENSUS/SRD/RR-84/17. Washington, DC: U.S. Bureau of the Census. Available at http://www.census.gov/srd/papers/pdf/rr84-17.pdf.

Lenzen M., B. Gallego and R. Wood. 2009. “Matrix Balancing under Conflicting Information.” Economic Systems Research. 21(1), 23–440.

Sands, R. 2003. “A SAS® Macro for the Controlled Rounding of One- and Two-Dimensional Tables of Real Numbers,” NESUG 2003: Proceedings. Available at http://www.nesug.org/html/Proceedings/nesug03/st/st001.pdf.

SAS Institute. No date. “A Transportation Problem.” Available at http://support.sas.com/documentation/cdl/en/ormpug/59679/HTML/default/viewer.htm#optmodel_sect5.htm.

Schneider, M. H. and S. A. Zenios. 1990. “A Comparative Study of Algorithms for Matrix Balancing.” Operations Research. 38(3), 439–455.

Temurshoev U., R. E. Miller, and M. C. Bouwmeester. 2013. “A Note on the GRAS Method.” Economic Systems Research. 25(3), 361–367.

Tyndall, R. 2007. “Give Your Macro Code an Extreme Makeover: Tips for Even the Most Seasoned Macro Programmer.” SAS Institute Technical Note TS-739. Available at http://support.sas.com/techsup/technote/ts739.pdf.